Skip to main content
SpringerLink
Log in

Design and development of ENprover, an automated theorem proving system based on EN-strategy

  • Short Papers
  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1990)

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

  • 115 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. S.Anantharaman, J.Hsiang, J.Mazali, "SbReve2: A Term Rewriting Laboratory with (AC-Unfailing Completion", in RTA89, LNCS 355, 1989

    Google Scholar 

  2. J.Avenhaus, J.Denzinger, J.Muller, "THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques", in RTA89, LNCS 355, 1989

    Google Scholar 

  3. F.Baj, "Development of an ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1989

    Google Scholar 

  4. F.Baj, G.Ferrari, D.Galli, "Theorem proving in supercomputing", Supercomputing Tools for Science and Engineering — Workshop Proc., 1989

    Google Scholar 

  5. M.P.Bonacina, G.Sanna, "KBlab: An Equational Theorem Prover for the Macintosh", in RTA89, LNCS 355, 1989

    Google Scholar 

  6. R.Boyer, E.Lusk, W.McCune, R.Overbeek, M.Stickel, L.Wos, "Set theory in first order logic: clauses for Goedel axioms", JAR 1, 1986

    Google Scholar 

  7. J.Christian, "Fast Knuth-Bendix Completion: Summary", in RTA89, LNCS355, 1989

    Google Scholar 

  8. N.Dershowitz, J.Hsiang, "Rewrite methods for clausal and non-clausal theorem proving", Proc. ICALP 83, LNCS 154, 1983

    Google Scholar 

  9. G.Ferrari, "ENprover in C Language on Transputers" (in Italian), Thesis, Comp. Sc. Dep. of Milan, 1989

    Google Scholar 

  10. J.Hsiang, "Refutational Theorem Proving Using Term Rewriting Systems", AI J. 1985, Manuscript, Univ of Illinois at Urbana, Dep. Comp. Scie., 1981

    Google Scholar 

  11. J.Hsiang, "Topics in Automated Theorem Proving and Program Generation", AI J., 1985, PhD Thesis, Univ of Illinois at Urbana, Dep. Comp. Scie., 1982

    Google Scholar 

  12. J.Hsiang, "Refutational theorem proving using term rewriting systems", Art. Int. 25, 1985

    Google Scholar 

  13. J.Hsiang, "Rewrite Method for Theorem Proving in First Order Theory with Equality", J. Symb. Comp., 1987

    Google Scholar 

  14. J.Hsiang, N.A.Josephson, "TeRSe: A Rewriting Theorem Prover", in Proc. Rewrite Rule Laboratory Workshop, Schenectady, NY, 1983

    Google Scholar 

  15. D.Kalish, R.Montague, "Logic, thechniques of formal reasoning", H.Brace & World Inc, 1964

    Google Scholar 

  16. D.Kapur, H.Zhang, "An Overview of Rewrite Rule Laboratory (RRL)", in RTA89, LNCS 355, 1989

    Google Scholar 

  17. G.Leidi, "An ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1988

    Google Scholar 

  18. W.W.McCune, OTTER 1.0 Users' Guide, Argonne National Lab. Report, ANL-88-44, 1989

    Google Scholar 

  19. F.J.Pelletier, "Seventy-five problems for testing automatic theorem provers", JAR 2, 1986

    Google Scholar 

  20. B.Smith, R.Wilkerson, "Non-Obviousness — Again", AAR Newsletter 11, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Moretto da Brescia 9, 20133, Milano

    Fabio Baj, Massimo Bruschi & Antonella Zanzi

Authors
  1. Fabio Baj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimo Bruschi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonella Zanzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Miola

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baj, F., Bruschi, M., Zanzi, A. (1990). Design and development of ENprover, an automated theorem proving system based on EN-strategy. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_154

Download citation

  • DOI: https://doi.org/10.1007/3-540-52531-9_154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52531-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation