THEOPOGLES — An efficient theorem prover based on rewrite-techniques

  • J. Avenhaus
  • J. Denzinger
  • J. Müller
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD87]
    Bachmair, L., Dershowitz, N.: Inference Rules for Rewrite-Based First-Order Theorem Proving, 2nd LICS, May 1987.Google Scholar
  2. [D87]
    Denzinger, J.: Implementation of a Theorem Prover Based on Rewriting-Techniques (in German), project-report, University of Kaiserslautern.Google Scholar
  3. [D88]
    Denzinger, J.: EQTHEOPOGLES (in German), M.S. thesis, University of Kaiserslautern.Google Scholar
  4. [DM87]
    Denzinger, J., Müller, J.: THEOPOGLES user manual, University of Kaiserslautern.Google Scholar
  5. [H85]
    Hsiang, J.: Refutational Theorem Proving using Term Rewriting Systems, AI 25, 1985, 255–300.Google Scholar
  6. [H87]
    Hsiang, J.: Rewrite Method for Theorem Proving in First Order Theory with Equality, J. of Symb. Comp., 1987.Google Scholar
  7. [KN85]
    Kapur, D., Narendran, P.: An Equational Approach to Theorem Proving in First-Order Predicat Calculus, 84CRD322, GEC Research and Dev. Report. Schenactady, N.Y., Sept. 85.Google Scholar
  8. [M87]
    Müller, J.: THEOPOGLES — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure, Proc. 11th GWAI, Sept. 87, Springer IFB 152.Google Scholar
  9. [M88]
    Müller, J.: Theorem Proving with Rewrite-Techniques, — Methods, Strategies and Comparisons — (in German), Ph.D.Thesis, University of Kaiserslautern, Nov. 1988.Google Scholar
  10. [MS88a]
    Müller, J., Socher-Ambrosius, R.: On the Unnecessity of Multiple-Overlaps in Completion Theorem Proving, Proc. 12th GWAI, Sept. 88, Springer IFB 181.Google Scholar
  11. [MS88b]
    Müller, J., Socher-Ambrosius, R.: Topics in Completion Theorem Proving, SEKI-Report SR-88-13, University of Kaiserslautern.Google Scholar
  12. [MS89]
    Müller, J., Socher-Ambrosius, R.: Normalization in Resolution and Completion Theorem Proving, Draft, submitted to ICALP '89.Google Scholar
  13. [R87]
    Rusinowitch, M.: Demonstration automatique par des techniques de reecriture, These de Doctorat d'Etat en Mathematique, Nancy, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • J. Avenhaus
    • 1
  • J. Denzinger
    • 1
  • J. Müller
    • 1
  1. 1.Department of Computer ScienceUniversity of KaiserslauternKaiserslauternFRG

Personalised recommendations