The theorem prover of the program verifier Tatzelwurm

  • Thomas Käufl
  • Nicolas Zabel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 449)


  1. [1]
    W. Ackermann: Solvable Cases of the Decision Problem Studies in Logic and the Foundations of Mathematics, Amsterdam: 1954Google Scholar
  2. [2]
    Th. Käufl: Vereinfachung logischer Formeln in einem Vorbeweiser Dissertation, Fakultät für Informatik, Universität Karlsruhe: 1988Google Scholar
  3. [3]
    Th. Käufl: Reasoning About Systems of Linear Inequalities 9th International Conference on Automated Deduction, Lecture Notes on Computer Science; Berlin, Heidelberg, New York: 1988; SpringerGoogle Scholar
  4. [4]
    Th. Käufl: Simplification and Decision of Linear Inequalities over the Integers Technical Report 9/88, University of Karlsruhe, Institut für Logik, Komplexität und Deduktionssysteme: 1988Google Scholar
  5. [5]
    Th. Käufl: Cooperation of Decision Procedures in a Tableau-Based Theorem Prover Technical Report 16/89, University of Karlsruhe, Institut für Logik, Komplexität und Deduktionssysteme: 1989Google Scholar
  6. [6]
    C.G. Nelson, D.C. Oppen: Simplification by Cooperating Decision Procedures, ACM TOPLAS 1, pp. 245–257: 1979Google Scholar
  7. [7]
    K. Schütte: Proof Theory, Berlin, Heidelberg, New York: 1977Google Scholar
  8. [8]
    R.M. Smullyan: First-Order Logic Berlin, Heidelberg, New York: 1968Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Thomas Käufl
    • 1
  • Nicolas Zabel
    • 2
  1. 1.Institut für Logik, Komplexität und DeduktionssystemeUniversity of KarlsruheKarlsruhe 1FR of Germany
  2. 2.LIFIA-INPGGrenoble CedexFrance

Personalised recommendations