Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1989: Rewriting Techniques and Applications pp 538–541Cite as

THEOPOGLES — An efficient theorem prover based on rewrite-techniques

  • System Descriptions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 355))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L., Dershowitz, N.: Inference Rules for Rewrite-Based First-Order Theorem Proving, 2nd LICS, May 1987.

    Google Scholar 

  2. Denzinger, J.: Implementation of a Theorem Prover Based on Rewriting-Techniques (in German), project-report, University of Kaiserslautern.

    Google Scholar 

  3. Denzinger, J.: EQTHEOPOGLES (in German), M.S. thesis, University of Kaiserslautern.

    Google Scholar 

  4. Denzinger, J., Müller, J.: THEOPOGLES user manual, University of Kaiserslautern.

    Google Scholar 

  5. Hsiang, J.: Refutational Theorem Proving using Term Rewriting Systems, AI 25, 1985, 255–300.

    Google Scholar 

  6. Hsiang, J.: Rewrite Method for Theorem Proving in First Order Theory with Equality, J. of Symb. Comp., 1987.

    Google Scholar 

  7. 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. 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. 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. 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. Müller, J., Socher-Ambrosius, R.: Topics in Completion Theorem Proving, SEKI-Report SR-88-13, University of Kaiserslautern.

    Google Scholar 

  12. Müller, J., Socher-Ambrosius, R.: Normalization in Resolution and Completion Theorem Proving, Draft, submitted to ICALP '89.

    Google Scholar 

  13. Rusinowitch, M.: Demonstration automatique par des techniques de reecriture, These de Doctorat d'Etat en Mathematique, Nancy, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kaiserslautern, 6750, Kaiserslautern, FRG

    J. Avenhaus, J. Denzinger & J. Müller

Authors
  1. J. Avenhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Denzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avenhaus, J., Denzinger, J., Müller, J. (1989). THEOPOGLES — An efficient theorem prover based on rewrite-techniques. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_132

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_132

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51081-9

  • Online ISBN: 978-3-540-46149-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation