- Titel
- Optimised Reasoning for SHIQ
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-789975
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 01-08
- Erstveröffentlichung
- 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.
- Freie Schlagwörter (DE)
- Subsumtion, SHIQ, Beschreibungslogik, FaCT
- Freie Schlagwörter (EN)
- subsumption, SHIQ, description logic, FaCT
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Aachen University of Technology, Aachen
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-789975
- Veröffentlichungsdatum Qucosa
- 24.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0