Computable set theory
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
A Fast Saturation Strategy for Set-Theoretic Tableaux
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Tableau Calculus for Quantifier-Free Set Theoretic Formulae
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Practical Integration of First-Order Reasoning and Decision Procedures
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Theory-specific automated reasoning
A 25-year perspective on logic programming
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning, Action and Interaction in AI Theories and Systems
| Hi-index | 0.00 |
In this paper we present a new fast tableau-based decision procedure for the ground set-theoretic fragment Multi-Level Syllogistic with Singleton (in short MLSS) which avoids the interleaving of model checking steps. The underlying tableau calculus is based upon the system KE.