- title
- Optimised Reasoning for SHIQ
- Please use the following URL when quoting:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-789975
- Series
- LTCS-Report
- multivolume_volume0
- 01-08
- publication_date
- 2001
- doi
- https://doi.org/10.25368/2022.118
- Abstract (EN)
- The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability and subsumption in SHIQ, a very expressive description logic providing, e.g., inverse and transitive roles, number restrictions, and general axioms. Intuitively, the algorithm searches for a tree-shaped abstraction of a model. To ensure termination of this algorithm without comprimising correctness, it stops expanding paths in the search tree using a so-called 'double-blocking' condition.
- Keywords (DE)
- Subsumtion, SHIQ, Beschreibungslogik, FaCT
- Keywords (EN)
- subsumption, SHIQ, description logic, FaCT
- Classification (DDC)
- 004
- Classification (RVK)
- ST 136
- university_publisher
- Aachen University of Technology, Aachen
- version
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-789975
- Qucosa date of publication
- 24.05.2022
- Document type
- report
- Document language
- English
- licence
CC BY 4.0