Show simple item record

dc.contributor.authorZhang, Xiaowangen_US
dc.contributor.authorLin, Zuoquanen_US
dc.contributor.authorWang, Kewenen_US
dc.contributor.editorXiaoyong Du, Wenfei Fan, Jianmin Wang, Zhiyong Peng, Mohamed A. Sharafen_US
dc.date.accessioned2017-05-03T14:10:57Z
dc.date.available2017-05-03T14:10:57Z
dc.date.issued2011en_US
dc.date.modified2013-05-30T01:24:51Z
dc.identifier.refurihttp://dx.doi.org/10.1007/978-3-642-20291-9en_US
dc.identifier.doi10.1007/978-3-642-20291-9_36en_US
dc.identifier.urihttp://hdl.handle.net/10072/42801
dc.description.abstractThis paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called /emph{minimal inconsistency} in paradoxical description logics, which is a paraconsistent version of description logics. A precedence relation between two paradoxical models of knowledge bases is firstly introduced to obtain minimally paradoxical models by filtering those models which contain more inconsistencies than others. A new entailment relationship between a KB and an axiom characterized by minimal paradoxical models is applied to characterize the semantics of a paraconsistent and nonmonotonic description logic. An important advantage of our adaptation is simultaneously overtaking proverbial shortcomings of existing two kinds extensions of description logics: the weak inference power of paraconsistent description logics and the incapacity of nonmonotonic description logics in handling inconsistencies. Moreover, our paraconsistent and nonmonotonic extension not only preserves the syntax of description logic but also maintains the decidability of basic reasoning problems in description logics. Finally, we develop a sound and complete tableau algorithm for instance checking with the minimally paradoxical semantics.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent201190 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherSpringeren_US
dc.publisher.placeUnited Kingdomen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofconferencenameAPWeb 2011en_US
dc.relation.ispartofconferencetitleProceedings 13th Asia-PacificWeb Conference: Web Technologies and Applicationsen_US
dc.relation.ispartofdatefrom2011-04-18en_US
dc.relation.ispartofdateto2011-04-20en_US
dc.relation.ispartoflocationBeijing, Chinaen_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classifieden_US
dc.subject.fieldofresearchcode080199en_US
dc.titleA tableau algorithm for paraconsistent and nonmonotonic reasoning in description logic-based systemen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.rights.copyrightCopyright 2011 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.comen_US
gro.date.issued2011
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record