Please use this identifier to cite or link to this item: https://rfos.fon.bg.ac.rs/handle/123456789/405
Full metadata record
DC FieldValueLanguage
dc.creatorKrdzavac, Nenad
dc.creatorĐurić, Dragan
dc.creatorDevedžić, Vladan
dc.date.accessioned2023-05-12T10:03:10Z-
dc.date.available2023-05-12T10:03:10Z-
dc.date.issued2006
dc.identifier.issn1571-5736
dc.identifier.urihttps://rfos.fon.bg.ac.rs/handle/123456789/405-
dc.description.abstractThe paper presents the architecture and design of a description logics (DLs) reasoner based on the Model Driven Architecture (MDA) methodology. The architecture relies on OMG's description logics metamodel, tableau metamodel, and model transformations using a language for model transformation. We show an example of DLs knowledge base using UML notation in context of MDA. The idea can be easily applied to implementation of a first-order logic theorem prover. The paper does not discuss implementation details of reasoning algorithms and the reasoner performance.en
dc.publisherSpringer New York
dc.rightsopenAccess
dc.sourceIFIP International Federation for Information Processing
dc.titleMDA-based architecture of a description logics reasoneren
dc.typearticle
dc.rights.licenseARR
dc.citation.epage105
dc.citation.other204: 98-105
dc.citation.spage98
dc.citation.volume204
dc.identifier.doi10.1007/0-387-34224-9_12
dc.identifier.fulltexthttp://prototype2.rcub.bg.ac.rs/bitstream/id/1001/401.pdf
dc.identifier.rcubconv_2973
dc.identifier.scopus2-s2.0-33749181073
dc.identifier.wos000238056900012
dc.type.versionpublishedVersion
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Radovi istraživača / Researchers’ publications
Files in This Item:
File Description SizeFormat 
401.pdf487.8 kBAdobe PDFThumbnail
View/Open
Show simple item record

SCOPUSTM   
Citations

2
checked on Nov 17, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.