Practical Reasoning for Expressive Description Logics

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 satis ability 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. c Springer-Verlag http://www.springer.de/comp/lncs/index.html

DOI: 10.1007/3-540-48242-3_11
020406080'00'02'04'06'08'10'12'14'16
Citations per Year

662 Citations

Semantic Scholar estimates that this publication has 662 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Horrocks1999PracticalRF, title={Practical Reasoning for Expressive Description Logics}, author={Ian Horrocks and Ulrike Sattler and Stephan Tobies}, booktitle={LPAR}, year={1999} }