Advertisement

Generating finite counter examples with semantic tableaux

  • Stefan Klingenbeck
Classical Logic — Extensions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 918)

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.

Keywords

Automated deduction semantic tableau counter examples finite models 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BG91]
    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.Google Scholar
  2. [BH92]
    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.Google Scholar
  3. [CZ92]
    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.Google Scholar
  4. [CZ93]
    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.Google Scholar
  5. [DG79]
    Burton Dreben and William D. Goldfarb. The Decision Problem — Solvable Classes of Quantificational Formulas. Addison-Wesley, 1979.Google Scholar
  6. [DHKK94]
    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.Google Scholar
  7. [FH92]
    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.Google Scholar
  8. [Fit90]
    Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.Google Scholar
  9. [FLTZ93]
    C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer LNAI 679, 1993.Google Scholar
  10. [Joy76]
    William H. Joyner. Resolution strategies as decision procedures. Journal of the Association for Computing Machinery, 23(3):398–417, 1976.Google Scholar
  11. [KH94]
    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.Google Scholar
  12. [Sla93]
    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.Google Scholar
  13. [Tam90]
    Tanel Tammet. The resolution program, able to decide some solvable classes. In Proceedings COLOG-88, Talin, pages 300–312. Springer, LNCS 417, 1990.Google Scholar
  14. [WW78]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Stefan Klingenbeck
    • 1
  1. 1.Complexity and Deduction SystemsUniversity of Karlsruhe Institute for LogicKarlsruheGermany

Personalised recommendations