References
S.Anantharaman, J.Hsiang, J.Mazali, "SbReve2: A Term Rewriting Laboratory with (AC-Unfailing Completion", in RTA89, LNCS 355, 1989
J.Avenhaus, J.Denzinger, J.Muller, "THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques", in RTA89, LNCS 355, 1989
F.Baj, "Development of an ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1989
F.Baj, G.Ferrari, D.Galli, "Theorem proving in supercomputing", Supercomputing Tools for Science and Engineering — Workshop Proc., 1989
M.P.Bonacina, G.Sanna, "KBlab: An Equational Theorem Prover for the Macintosh", in RTA89, LNCS 355, 1989
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
J.Christian, "Fast Knuth-Bendix Completion: Summary", in RTA89, LNCS355, 1989
N.Dershowitz, J.Hsiang, "Rewrite methods for clausal and non-clausal theorem proving", Proc. ICALP 83, LNCS 154, 1983
G.Ferrari, "ENprover in C Language on Transputers" (in Italian), Thesis, Comp. Sc. Dep. of Milan, 1989
J.Hsiang, "Refutational Theorem Proving Using Term Rewriting Systems", AI J. 1985, Manuscript, Univ of Illinois at Urbana, Dep. Comp. Scie., 1981
J.Hsiang, "Topics in Automated Theorem Proving and Program Generation", AI J., 1985, PhD Thesis, Univ of Illinois at Urbana, Dep. Comp. Scie., 1982
J.Hsiang, "Refutational theorem proving using term rewriting systems", Art. Int. 25, 1985
J.Hsiang, "Rewrite Method for Theorem Proving in First Order Theory with Equality", J. Symb. Comp., 1987
J.Hsiang, N.A.Josephson, "TeRSe: A Rewriting Theorem Prover", in Proc. Rewrite Rule Laboratory Workshop, Schenectady, NY, 1983
D.Kalish, R.Montague, "Logic, thechniques of formal reasoning", H.Brace & World Inc, 1964
D.Kapur, H.Zhang, "An Overview of Rewrite Rule Laboratory (RRL)", in RTA89, LNCS 355, 1989
G.Leidi, "An ATP for FOPC+=" (in Italian), Thesis, Comp. Sc. Dep. Milan, 1988
W.W.McCune, OTTER 1.0 Users' Guide, Argonne National Lab. Report, ANL-88-44, 1989
F.J.Pelletier, "Seventy-five problems for testing automatic theorem provers", JAR 2, 1986
B.Smith, R.Wilkerson, "Non-Obviousness — Again", AAR Newsletter 11, 1989
Author information
Authors and Affiliations
Editor information
Rights 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