Abstract
“prove((E,F),A,B,C,D):- !, prove(E,[F|A],B,C,D). prove((E;F),A,B,C,D):- !, prove(E,A,B,C,D), prove(F,A,B,C,D). prove(all(H,I),A,B,C,D):- !, +length(C,D), copy_term((H,I,C), (G,F,C)), append(A, [all(H,I)],E), prove(F,E,B, [G|C],D). prove(A,_,[C|D],_,_):-((A= -(B); -(A)=B)) → (unify(B,C); prove(A,[],D,_,_)). prove(A,[E|F],B,C,D):- prove(E,F, [A|B],C,D).” implements a first-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and efficient.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Beckert, S. Gerberding, R. Hähnle, and W. Kernig. The tableau-based theorem prover 3TAP for multiple-valued logics. In Proceedings, CADE 11, Albany/NY, LNCS. Springer, 1992.
B. Beckert and R. Hähnle. An improved method for adding equality to free variable semantic tableaux. In Proceedings, CADE 11, Albany/NY, LNCS. Springer, 1992.
B. Beckert, R. Hähnle, and P. H. Schmitt. The even more liberalized δ-rule in free variable semantic tableaux. In Proceedings, 3rd Kurt Gödel Colloquium, Brno, Czech Republic, LNCS. Springer, 1993.
B. Beckert and J. Posegga. leanTAP: Lean tableau-based theorem proving. To appear (available upon request from the authors), 1994.
E. Eder. Relative Complexities of First-Order Calculi. Artificial Intelligence. Vieweg Verlag, 1992.
M. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1990.
R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog. In Proceedings, CADE 9, Argonne, LNCS. Springer, 1988.
F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.
J. Posegga. Compiling proof search in semantic tableaux. In Proceedings, ISMIS 7, Trondheim, Norway, LNCS. Springer, 1993.
M. E. Stickel. A prolog technology theorem prover. In Proceedings, CADE 9, Argonne, LNCS. Springer, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beckert, B., Posegga, J. (1994). LeanT A P: Lean tableau-based theorem proving. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_62
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive