Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hyper-tableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed for either Horn DLs (which do not support disjunction), or for DLs without counting quantifiers. In this paper we present a novel consequence-based calculus for SRIQ— a rich DL that supports both features. This extension is non-trivial since the intermediate consequences that need to be derived during reasoning cannot be captured using DLs themselves. The results of our preliminary performance evaluation suggest the feasibility of our approach in practice.
Extending Consequence-Based Reasoning to SHIQ
A. Bate,B. Motik,B. C. Grau,F. Simančík,Ian Horrocks
Published 2016 in Description Logics
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
Description Logics
- Publication date
2016-02-14
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-32 of 32 references · Page 1 of 1
CITED BY
Showing 1-24 of 24 citing papers · Page 1 of 1