Expressive description logics via SAT: the story so far

Authors:
Francis Gasse;Volker Haarslev
Affiliations:
Concordia University, Montreal, Quebec, Canada;Concordia University, Montreal, Quebec, Canada
Venue:
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
Year:
2009

Citing 5
Cited 0

Attributive concept descriptions with complements

Artificial Intelligence
PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
A correspondence theory for terminological logics: preliminary report

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Encoding the satisfiability of modal and description logics into SAT: the case study of K(m)/ALC

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Boolean Satisfiability (SAT) problem is widely researched and the solvers' performances largely benefit from it. Satisfiability Modulo Theory (SMT) solvers aim to leverage these performances toward other formalisms with large propositional content. Description Logics are an expressive subset of first-order logic with high complexity reasoning (e.g. SHOQ is Exp-Time-complete) that could benefit from this approach. In this paper, we present a SMT-based DL reasoner, its reasoning technique, its implementation and some early experimental results.