Abstract
This article presents a tableau-like calculus for generating finite counter examples for first-order formulas with equality. Tableau branches are augmented by assigning a non empty subset of the universe to each simple term. This assignment is subject to a revision process, comparable to the approximation of functions by a sequence of step functions in numerical mathematics, resulting in non-Herbrand interpretations for predicate, function and constant symbols. Soundness and completeness of the proposed procedure are defined and proved.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-9-1-208, Max-Planck-Institut für Informatik, MPI at Saarbrücken, Germany, 1991.
Bernhard Beckert and Reiner Hähnle. An improved method for adding equality to free variable semantic tableaux. In Proc. of the 11th Int. Conf. on Automated Deduction, pages 507–521. Springer, LNAI, 607, 1992.
Ricardo Caferra and Nicolas Zabel. A method for simultaneous search for refutations and models by equational constraint solving. J. of Symbolic Computation, 13:613–641, 1992.
Ricardo Caferra and Nicolas Zabel. A tableaux method for systematic simultaneous search for refutations and models using equational problems. J. of Logic and Computation, 3(1):3–25, 1993.
Burton Dreben and William D. Goldfarb. The Decision Problem — Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.
Peter Deussen, Alex Hansmann, Thomas Käufl, and Stefan Klingenbeck. The verification system Tatzelwurm. In M. Broy and S. Jähnichen, editors, KORSO, Correct Software by Formal Methods. Springer LNCS, to appear, 1994.
Masayuki Fujita and Ryuzo Hasegawa. Model generation theorem provers on a parallel inference machine. In Proc. of the Int. Conf. on Fifth Generation Computer Systems, pages 357–375. ICOT, 1992.
Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.
C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer LNAI 679, 1993.
William H. Joyner. Resolution strategies as decision procedures. Journal of the Association for Computing Machinery, 23(3):398–417, 1976.
Stefan Klingenbeck and Reiner Hähnle. Semantic tableaux with ordering restrictions. In Proc. of the 12th Int. Conf. on Automated Deduction. Springer, LNAI, 814, 1994.
John Slaney. FINDER — finite domain enumerator automatic theorem proving with renamable and semantic resolution. Technical report, Centre for Information Science Research, Australian National University, 1993.
Tanel Tammet. The resolution program, able to decide some solvable classes. In Proceedings COLOG-88, Talin, pages 300–312. Springer, LNCS 417, 1990.
S. Winker and L. Wos. Automated generation of models and counter examples and its application to open questions in ternary boolean algebra. In Proc. of the 8th Int. Symp. on Multiple-Valued Logic, pages 251–256. IEEE, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klingenbeck, S. (1995). Generating finite counter examples with semantic tableaux. In: Baumgartner, P., Hähnle, R., Possega, J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science, vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-59338-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59338-6
Online ISBN: 978-3-540-49235-1
eBook Packages: Springer Book Archive