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

  • Fabio Baj
  • Massimo Bruschi
  • Antonella Zanzi
Short Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 429)


  1. [AHM]
    S.Anantharaman, J.Hsiang, J.Mazali, "SbReve2: A Term Rewriting Laboratory with (AC-Unfailing Completion", in RTA89, LNCS 355, 1989Google Scholar
  2. [ADM]
    J.Avenhaus, J.Denzinger, J.Muller, "THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques", in RTA89, LNCS 355, 1989Google Scholar
  3. [Ba]
    F.Baj, "Development of an ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1989Google Scholar
  4. [BFG]
    F.Baj, G.Ferrari, D.Galli, "Theorem proving in supercomputing", Supercomputing Tools for Science and Engineering — Workshop Proc., 1989Google Scholar
  5. [BS]
    M.P.Bonacina, G.Sanna, "KBlab: An Equational Theorem Prover for the Macintosh", in RTA89, LNCS 355, 1989Google Scholar
  6. [BLMOSW]
    R.Boyer, E.Lusk, W.McCune, R.Overbeek, M.Stickel, L.Wos, "Set theory in first order logic: clauses for Goedel axioms", JAR 1, 1986Google Scholar
  7. [Ch]
    J.Christian, "Fast Knuth-Bendix Completion: Summary", in RTA89, LNCS355, 1989Google Scholar
  8. [DH]
    N.Dershowitz, J.Hsiang, "Rewrite methods for clausal and non-clausal theorem proving", Proc. ICALP 83, LNCS 154, 1983Google Scholar
  9. [Fe]
    G.Ferrari, "ENprover in C Language on Transputers" (in Italian), Thesis, Comp. Sc. Dep. of Milan, 1989Google Scholar
  10. [Hs81]
    J.Hsiang, "Refutational Theorem Proving Using Term Rewriting Systems", AI J. 1985, Manuscript, Univ of Illinois at Urbana, Dep. Comp. Scie., 1981Google Scholar
  11. [Hs82]
    J.Hsiang, "Topics in Automated Theorem Proving and Program Generation", AI J., 1985, PhD Thesis, Univ of Illinois at Urbana, Dep. Comp. Scie., 1982Google Scholar
  12. [Hs85]
    J.Hsiang, "Refutational theorem proving using term rewriting systems", Art. Int. 25, 1985Google Scholar
  13. [Hs87]
    J.Hsiang, "Rewrite Method for Theorem Proving in First Order Theory with Equality", J. Symb. Comp., 1987Google Scholar
  14. [HJ]
    J.Hsiang, N.A.Josephson, "TeRSe: A Rewriting Theorem Prover", in Proc. Rewrite Rule Laboratory Workshop, Schenectady, NY, 1983Google Scholar
  15. [KM]
    D.Kalish, R.Montague, "Logic, thechniques of formal reasoning", H.Brace & World Inc, 1964Google Scholar
  16. [KZ]
    D.Kapur, H.Zhang, "An Overview of Rewrite Rule Laboratory (RRL)", in RTA89, LNCS 355, 1989Google Scholar
  17. [Le]
    G.Leidi, "An ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1988Google Scholar
  18. [McC]
    W.W.McCune, OTTER 1.0 Users' Guide, Argonne National Lab. Report, ANL-88-44, 1989Google Scholar
  19. [Pe]
    F.J.Pelletier, "Seventy-five problems for testing automatic theorem provers", JAR 2, 1986Google Scholar
  20. [SW]
    B.Smith, R.Wilkerson, "Non-Obviousness — Again", AAR Newsletter 11, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Fabio Baj
    • 1
  • Massimo Bruschi
    • 1
  • Antonella Zanzi
    • 1
  1. 1.Dipartimento di Scienze dell'InformazioneUniversità degli Studi di MilanoMilano

Personalised recommendations