@inbook {89,
	title = {Logics for the Semantic Web},
	booktitle = {Handbook of the History of Logic},
	volume = {9},
	year = {2014},
	pages = {679-710},
	publisher = {Elsevier},
	organization = {Elsevier},
	author = {Pascal Hitzler and Jens Lehmann and Axel Polleres},
	editor = {Dov. M. Gabbay and John Woods and J{\"o}rg Siekmann}
}
@conference {140,
	title = {{OWL} and Rules},
	booktitle = {Reasoning Web. Semantic Technologies for the Web of Data - 7th International Summer School 2011, Galway, Ireland, August 23-27, 2011, Tutorial Lectures},
	volume = {6848},
	year = {2011},
	month = {08/2011},
	pages = {382-415},
	publisher = {Springer},
	organization = {Springer},
	abstract = {The relationship between the Web Ontology Language OWL and rule-based formalisms has been the subject of many discussions and research investigations, some of them controversial. From the many attempts to reconcile the two paradigms, we present some of the newest developments. More precisely, we show which kind of rules can be modeled in the current version of OWL, and we show how OWL can be extended to incorporate rules. We finally give references to a large body of work on rules and OWL.
},
	isbn = {978-3-642-23031-8},
	doi = {10.1007/978-3-642-23032-5},
	url = {http://dx.doi.org/10.1007/978-3-642-23032-5},
	author = {Adila Krisnadhi and Frederick Maier and Pascal Hitzler},
	editor = {Axel Polleres and Claudia d{\textquoteright}Amato and Marcelo Arenas and Siegfried Handschuh and Paula Kroner and Sascha Ossowski and Peter F. Patel-Schneider}
}
@conference {118,
	title = {Paraconsistent Reasoning for OWL 2},
	booktitle = {Web Reasoning and Rule Systems, Third International Conference, RR 2009},
	volume = {5837},
	year = {2009},
	pages = {197{\textendash}211},
	publisher = {Springer},
	organization = {Springer},
	address = {Chantilly, VA, USA},
	abstract = {<p class="rtejustify">A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as under the classical semantics. However, this approach has so far only been studied for the basid description logic ALC. In this paper, we further study how to extend the four-valued semantics to the more expressive description logic SROIQ which underlies the forthcoming revision of the Web Ontology Language, OWL 2, and also investigate how it fares when adapated to tractable description logics including EL++, DL-Lite, and Horn-DLs. We define the four-valued semantics along the same lines as for ALC and show that we can retain most of the desired properties.</p>
},
	doi = {10.1007/978-3-642-05082-4_14},
	url = {http://dx.doi.org/10.1007/978-3-642-05082-4_14},
	author = {Yue Ma and Pascal Hitzler},
	editor = {Axel Polleres and Terrance Swift}
}
@conference {117,
	title = {A Preferential Tableaux Calculus for Circumscriptive ALCO},
	booktitle = {Web Reasoning and Rule Systems, Third International Conference, RR 2009},
	volume = {5837},
	year = {2009},
	pages = {40{\textendash}54},
	publisher = {Springer},
	organization = {Springer},
	address = {Chantilly, VA, USA},
	abstract = {<p class="rtejustify">Nonmonotonic extensions of description logics (DLs) allow for default and local closed-world reasoning and are an acknowledged desired feature for applications, e.g. in the Semantic Web. A recent approach to such an extension is based on McCarthy{\textquoteright}s circumscription, which rests on the principle of minimising the extension of selected predicates to close off dedicated parts of a domain model. While decidability and complexity results have been established in the literature, no practical algorithmisation for circumscriptive DLs has been proposed so far. In this paper, we present a tableaux calculus that can be used as a decision procedure for concept satisfiability with respect to conceptcircumscribed ALCO knowledge bases. The calculus builds on existing tableaux for classical DLs, extended by the notion of a preference clash to detect the non-minimality of constructed models.</p>
},
	doi = {10.1007/978-3-642-05082-4_4},
	url = {http://dx.doi.org/10.1007/978-3-642-05082-4_4},
	author = {Stephan Grimm and Pascal Hitzler},
	editor = {Axel Polleres and Terrance Swift}
}
