A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
On Solving Presburger and Linear Arithmetic with SAT
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A New System and Methodology for Generating Random Modal Formulae
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
BDD-Based Decision Procedures for K
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
Proceedings of the 40th annual Design Automation Conference
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information
Journal of Biomedical Informatics
Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A new general method to generate random modal formulae for testing decision procedures
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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
Automated reasoning in ALCQ via SMT
CADE'11 Proceedings of the 23rd international conference on Automated deduction
InKreSAT: modal reasoning via incremental reduction to SAT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Formal methods for exchange policy specification
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
In the last two decades, modal and description logics have been applied to numerous areas of computer science, including knowledge representation, formal verification, database theory, distributed computing and, more recently, semantic web and ontologies. For this reason, the problem of automated reasoning in modal and description logics has been thoroughly investigated. In particular, many approaches have been proposed for efficiently handling the satisfiability of the core normal modal logic Km, and of its notational variant, the description logic ALC. Although simple in structure, Km/ALC is computationally very hard to reason on, its satisfiability being PSpace-complete. In this paper we start exploring the idea of performing automated reasoning tasks in modal and description logics by encoding them into SAT, so that to be handled by state-of-the-art SAT tools; as with most previous approaches, we begin our investigation from the satisfiability in Km. We propose an efficient encoding, and we test it on an extensive set of benchmarks, comparing the approach with the main state-of-the-art tools available. Although the encoding is necessarily worst-case exponential, from our experiments we notice that, in practice, this approach can handle most or all the problems which are at the reach of the other approaches, with performances which are comparable with, or even better than, those of the current state-of-the-art tools.