A new fast tableau-based decision procedure for an unquantified fragment of set theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1761 LNAI, Issue , 2000, Pages 126-136

  Cantone, Domenico ^a   Zarba, Calogero G ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MODEL CHECKING; THEOREM PROVING;

DECISION PROCEDURE; MULTILEVELS;

DECISION THEORY;

EID: 84867772075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_8     Document Type: Conference Paper

References (9)

1. Bernhard Beckert and Ulrike Hartmer. A tableau calculus for quantifier-free set theoretic formulae. In Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Oisterwijk, The Netherlands, LNCS 1397, pages 93-107. Springer, 1998.
2. th Intl. Conference on Computer Aided Verification, volume 1102 of LNCS, pages 415-418. Springer-Verlag, July 1996.
3. th Intl. Conference on Automated Deduction, volume 1249 of LNCS, pages 101-115. Springer-Verlag, July 1997.
4. Domenico Cantone. A fast saturation strategy for set-theoretic Tableaux. In Didier Galmiche, editor, Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, volume 1227 of LNAI, pages 122-137, Berlin, May13-16 1997. Springer.
5. Domenico Cantone and Alfredo Ferro. Techniques of computable set theory with applications to proof verification. Comm. Pure Appl. Math., XLVIII:1-45, 1995.
6. Domenico Cantone, Alfredo Ferro, and Eugenio Omodeo. Computable set theory, volume no.6 Oxford Science Publications of International Series of Monographs on Computer Science. Clarendon Press, 1989.
7. Marcello D'Agostino and Marco Mondadori. The taming of the cut. Classical refutations with analytic cut. Journal of Logic and Computation, 4(3):285-319, June 1994.
8. Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer-Verlag, Berlin, 2nd edition, 1996. 1st ed., 1990.
9. Calogero G. Zarba. Dimostrazione automatica di formule inisiemistiche con tagli analitici. Tesi di Laurea, Università di Catania (in Italian), July 1998.