Practical Reasoning for Expressive Description Logics

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
This paper appeared in the Proceedings of LPAR'99

Keywords

Logic in Computer Science, Artificial Intelligence, F.4.1, I.2.3, I.2.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30266

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0005014
 http://arxiv.org/abs/cs/0005014

Collections

arXiv