@article {60,
	title = {Complexities of Horn Description Logics},
	journal = {ACM Trans. Comput. Log.},
	volume = {14},
	year = {2013},
	pages = {2},
	abstract = {Description Logics (DLs) have become a prominent paradigm for representing knowledge bases in a variety of application areas. Central to leveraging them for corresponding systems is the provision of a favourable balance between expressivity of the knowledge representation formalism on the one hand, and runtime performance of reasoning algorithms on the other. Due to this, Horn description logics (Horn DLs) have attracted attention since their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large sets of instance data (ABoxes). However, the natural question whether Horn DLs also provide advantages for schema (TBox) reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn DLs. While the combined complexity for many Horn DLs studied herein turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning. We also provide convenient normal forms for Horn DLs.},
	keywords = {computational complexity, description logics, Horn logic},
	doi = {10.1145/2422085.2422087},
	url = {http://doi.acm.org/10.1145/2422085.2422087},
	author = {Markus Kr{\"o}tzsch and Sebastian Rudolph and Pascal Hitzler}
}
@conference {143,
	title = {Local Closed World Semantics: Keep it simple, stupid!},
	booktitle = {Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011},
	volume = {745},
	year = {2011},
	month = {07/2011},
	publisher = {CEUR-WS.org},
	organization = {CEUR-WS.org},
	abstract = {A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web applications. However, none of the proposals made to date for extending description logics with local closed world capabilities has had any significant impact on applications. We believe that one of the key reasons for this is that current proposals fail to provide approaches which are intuitively accessible for application developers and at the same time are applicable, as extensions, to expressive description logics such as SROIQ, which underlies the Web Ontology Language OWL. In this paper we propose a new approach which overcomes key limitations of other major proposals made to date. It is based on an adaptation of circumscriptive description logics which, in contrast to previously reported circumscription proposals, is applicable to SROIQ without rendering reasoning over the resulting language undecidable.},
	keywords = {circumscription, closed world, decidability, Description Logic},
	url = {http://ceur-ws.org/Vol-745/paper_12.pdf},
	author = {Adila Krisnadhi and Kunal Sengupta and Pascal Hitzler},
	editor = {Riccardo Rosati and Sebastian Rudolph and Michael Zakharyaschev}
}
