@conference {141,
	title = {Local Closed World Semantics: Grounded Circumscription for Description Logics},
	booktitle = {Web Reasoning and Rule Systems - 5th International Conference, RR 2011, Galway, Ireland, August 29-30, 2011. Proceedings},
	volume = {6902},
	year = {2011},
	month = {08/2011},
	pages = {263-268},
	publisher = {Springer},
	organization = {Springer},
	abstract = {We 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.},
	isbn = {978-3-642-23579-5},
	doi = {10.1007/978-3-642-23580-1},
	url = {http://dx.doi.org/10.1007/978-3-642-23580-1},
	author = {Adila Krisnadhi and Kunal Sengupta and Pascal Hitzler},
	editor = {Sebastian Rudolph and Claudio Gutierrez}
}
@conference {98,
	title = {Paraconsistent Semantics for Hybrid MKNF Knowledge Bases},
	booktitle = {Web Reasoning and Rule Systems - 5th International Conference, RR 2011},
	volume = {6902},
	year = {2011},
	pages = {93{\textendash}107},
	publisher = {Springer},
	organization = {Springer},
	address = {Galway, Ireland},
	abstract = {<p class="rtejustify">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.</p>
},
	doi = {10.1007/978-3-642-23580-1_8},
	url = {http://dx.doi.org/10.1007/978-3-642-23580-1_8},
	author = {Shasha Huang and Qingguo Li and Pascal Hitzler},
	editor = {Sebastian Rudolph and Claudio Gutierrez}
}
