Reasoning with Individuals for the Description Logic SHIQ
By Ian Horrocks, U. Sattler, Stephan Tobies. CADE, 2000
334 citations recorded by the source corpus.
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 paper we present an algorithm for combined Tbox and Abox reasoning in the \(\mathcal{SHIQ}\) description logic. This algorithm is of particular interest as it can be used to decide the problem of (database) conjunctive query containment w.r.t. a schema. Moreover, the realisation of an efficient implementation should be relatively straightforward as it can be based on an existing highly optimised implementation of the Tbox algorithm in the FaCT system.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/0bd45a32c5f33b6df8712329a990ce5483228532
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ian Horrocks
- U. Sattler
- Ralf Möller
- Oliver Kutz
- Bernd Neumann
- Boris Motik
- Franz Baader
- Peter F. Patel-Schneider
In Computer Networks and Communications
- U. Sattler
- Ian Horrocks
- Oliver Kutz
- Boris Motik
- Peter F. Patel-Schneider
- Rob Shearer
- Joachim Hertzberg
- Andreas Nüchter
Citations in the corpus
- A Tableaux Decision Procedure for SHOIQ (2005, methodology): “Each concept can be transformed into an equivalent one in NNF by pushing negation inwards, making use of de Morgan’s laws and the duality between existential and universal restrictions, and between atmost and atleast number restrictions, [Horrocks et al., 2000].”
- On scene interpretation with description logics (2006, background): “• The family of DLs comprises a variety of representation languages ranging from languages with polynomial complexity such as CLASSIC [31] to highly expressive languages which – in the worst case – are no longer polynomial , such as SHIQ(D n ) À [32] [33] .”
- The Even More Irresistible SROIQ (2006, methodology): “The only interesting cases are C = (6nS.E), C = 8S.E, and C = (¬)9R.Self (for the other cases, see Horrocks, Sattler, & Tobies (2000) ; Horrocks & Sattler (2002)):”