JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Deduction Method Complete for Refutation and Finite Satisfiability
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Issues of Decidability for Description Logics in the Framework of Resolution
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Hyperresolution for guarded formulae
Journal of Symbolic Computation - Special issue: First order theorem proving
A reference ontology for biomedical informatics: the foundational model of anatomy
Journal of Biomedical Informatics - Special issue: Unified medical language system
The Description Logic Handbook
The Description Logic Handbook
Just the right amount: extracting modules from ontologies
Proceedings of the 16th international conference on World Wide Web
Optimized Reasoning in Description Logics Using Hypertableaux
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Ordering heuristics for description logic reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Reasoning over ontologies with hidden content: the import-by-query approach
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. To address this, we propose a tableau calculus with individual reuse: to satisfy an existential assertion, our calculus nondeterministically tries to reuse individuals from the model generated thus far. We present two expansion strategies: one is applicable to the DL $\mathcal{ELOH}$ and gives us a worst-case optimal algorithm, and the other is applicable to the DL $\mathcal{SHOIQ}$. Using this technique, our reasoner can process several KBs that no other reasoner can.