论文信息 - A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory

A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory

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.

Calogero G. Zarba | Domenico Cantone

[1] Domenico Cantone. A Fast Saturation Strategy for Set-Theoretic Tableaux , 1997, TABLEAUX.

[2] M. Fitting. First-order logic and automated theorem proving (2nd ed.) , 1996 .

[3] Nikolaj Bjørner,et al. A Practical Integration of First-Order Reasoning and Decision Procedures , 1997, CADE.

[4] Edward Y. Chang,et al. STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems , 1996, CAV.

[5] Marcello D'Agostino,et al. The Taming of the Cut. Classical Refutations with Analytic Cut , 1994, J. Log. Comput..

[6] Domenico Cantone,et al. What Is Computable Set Theory , 1990 .

[7] Bernhard Beckert,et al. A Tableau Calculus for Quantifier-Free Set Theoretic Formulae , 1998, TABLEAUX.

[8] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[9] Alfredo Ferro,et al. Techniques of computable set theory with applications to proof verification , 1995 .

[10] Leon Sterling,et al. Meta-Level Inference and Program Verification , 1982, CADE.