01042nas a2200193 4500008004100000020002200041245008200063210006900145260002200214300001200236490000900248520043600257100002100693700002000714700002000734700002300754700002300777856004800800 2011 eng d a978-3-642-23579-500aLocal Closed World Semantics: Grounded Circumscription for Description Logics0 aLocal Closed World Semantics Grounded Circumscription for Descri bSpringerc08/2011 a263-2680 v69023 aWe present an improved local closed world extension for description logics. It is based on circumscription, and deviates from previous circumscriptive description logics in that extensions of minimized predicates may contain only extensions of named individuals in the knowledge base. Besides an (arguably) higher intuitive appeal, the improved semantics is applicable to expressive description logics without loss of decidability.1 aKrisnadhi, Adila1 aSengupta, Kunal1 aHitzler, Pascal1 aRudolph, Sebastian1 aGutierrez, Claudio uhttp://dx.doi.org/10.1007/978-3-642-23580-101542nas a2200181 4500008004100000245006100041210006100102260003000163300001300193490000900206520099500215100001801210700001601228700002001244700002301264700002301287856005001310 2011 eng d00aParaconsistent Semantics for Hybrid MKNF Knowledge Bases0 aParaconsistent Semantics for Hybrid MKNF Knowledge Bases aGalway, IrelandbSpringer a93–1070 v69023 a
Hybrid MKNF knowledge bases, originally based on the stable model semantics, is a mature method of combining rules and Description Logics (DLs). The well-founded semantics for such knowledge bases has been proposed subsequently for better efficiency of reasoning. However, integration of rules and DLs may give rise to inconsistencies, even if they are respectively consistent. Accordingly, reasoning systems based on the previous two semantics will break down. In this paper, we employ the four-valued logic proposed by Belnap, and present a paraconsistent semantics for Hybrid MKNF knowledge bases, which can detect inconsistencies and handle it effectively. Besides, we transform our proposed semantics to the stable model semantics via a linear transformation operator, which indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide a fixpoint algorithm for computing paraconsistent MKNF models.
1 aHuang, Shasha1 aLi, Qingguo1 aHitzler, Pascal1 aRudolph, Sebastian1 aGutierrez, Claudio uhttp://dx.doi.org/10.1007/978-3-642-23580-1_8