Term rewriting and all that
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
How to reason with OWL in a logic programming system
RULEML '06 Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web
The Description Logic Handbook
The Description Logic Handbook
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Cheap Boolean Role Constructors for Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Description Logic Reasoning with Decision Diagrams
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Terminological reasoning in SHIQ with ordered binary decision diagrams
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Foundations of Semantic Web Technologies
Foundations of Semantic Web Technologies
Consequence-driven reasoning for horn SHIQ ontologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hypertableau reasoning for description logics
Journal of Artificial Intelligence Research
On the semantic relationship between datalog and description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
A comparison of reasoning techniques for querying large description logic ABoxes
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Query answering in the horn fragments of the description logics SHOIQ and SROIQ
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Consequence-based reasoning beyond horn ontologies
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Efficient rule-based inferencing for OWL EL
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
KBRE: a framework for knowledge-based requirements engineering
Software Quality Control
Hi-index | 0.00 |
Description logics (DLs) have become a prominent paradigm for representing knowledge in a variety of application areas, partly due to their ability to achieve a favourable balance between expressivity of the logic and performance of reasoning. Horn description logics are obtained, roughly speaking, by disallowing all forms of disjunctions. They have attracted attention since their (worst-case) data complexities are in general lower than those of their non-Horn counterparts, which makes them attractive for reasoning with large sets of instance data (ABoxes). It is therefore natural to ask whether Horn DLs also provide advantages for schema (TBox) reasoning, that is, whether they also feature lower combined complexities. This article settles this question for a variety of Horn DLs. An example of a tractable Horn logic is the DL underlying the ontology language OWL RL, which we characterize as the Horn fragment of the description logic SROIQ without existential quantifiers. If existential quantifiers are allowed, however, many Horn DLs become intractable. We find that Horn-ALC already has the same worst-case complexity as ALC, that is, ExpTime, but we also identify various DLs for which reasoning is PSpace-complete. As a side effect, we derive simplified syntactic definitions of Horn DLs for which we exploit suitable normal form transformations.