IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Keys, nominals, and concrete domains
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
AI Communications - Practical Aspects of Automated Reasoning
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Satisfiability modulo the theory of costs: foundations and applications
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Solving graded/probabilistic modal logic via linear inequalities (system description)
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Extended caching, backjumping and merging for expressive description logics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Reasoning techniques for qualified number restrictions (QNRs) in Description Logics (DLs) have been investigated in the past but they mostly do not make use of the arithmetic knowledge implied by QNRs. In this paper we propose and investigate a novel approach for concept satisfiability in acyclic ALCQ ontologies. It is based on the idea of encoding an ALCQ ontology into a formula in Satisfiability Modulo the Theory of Costs (SMT(C)), which is a specific and computationally much cheaper subcase of Linear Arithmetic under the Integers, and to exploit the power of modern SMT solvers to compute every conceptsatisfiability query on a given ontology. We implemented and tested our approach, which includes a very effective individuals-partitioning technique, on a wide set of synthesized benchmark formulas, comparing the approach with the main state-of-the-art DL reasoners available. Our empirical evaluation confirms the potential of the approach.