199 citations · 953 across the 42 of their papers we have counts for
6 papers · 1 filter
Computing CQ lower-bounds over OWL 2 through approximation to RSA
Federico Igne, Stefano Germano, Ian Horrocks
Conjunctive query (CQ) answering over knowledge bases is an important reasoning task. However, with expressive ontology languages such as OWL, query answering is computationally ve…
Hypertableau Reasoning for Description Logics
Boris Motik, Rob Shearer, Ian Horrocks
We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nond…
Reasoning with Individuals for the Description Logic SHIQ
Ian Horrock, Ulrike Sattler, Stephan Tobies
While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. In this pap…
Practical Reasoning for Expressive Description Logics
Ian Horrocks, Ulrike Sattler, Stephan Tobies
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive r…
Practical Reasoning for Very Expressive Description Logics
Ian Horrocks, Ulrike Sattler, Stephan Tobies
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive r…
Reasoning with Axioms: Theory and Pratice
Ian Horrocks, Stephan Tobies
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an…