Practical Reasoning for Expressive Description Logics

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles, role hierarchies, and qualifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ALC extended with just transitive and inverse roles is still in PSpace. Finally, we investigate the limits of decidability for this family of DLs.

Part of this work was carried out while being a guest at IRST, Trento.
This work was supported by the Esprit Project 22469 — DWQ and the DFG, Project No. GR 1324/3-1.