Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure-Reference-Cited by-同舟云学术

Theopogles — A Theorem Prover Based on First-Order Polynomials and a Special Knuth-Bendix Procedure

Published:1987 Issue: Volume: Page:241-250
ISSN:0343-3005
Container-title:GWAI-87 11th German Workshop on Artifical Intelligence
language:
Short-container-title:

Author:

Mueller Juergen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-73005-4_26.pdf

Reference14 articles.

1. Buchberger, B.: Basic Features and Development of the Critical-Pair/Completion Procedure, 1. Int. Conf. on Rewriting Techniques and Applications (RTA), Dijon, May 1985, Springer LNCS 202, 1–45.

2. Chang, C.L. and Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, N.Y. 1973.

3. Corbin, J., Bidoit, M.: A Rehabilitation of Robinson’s Unification Algorithm, in Information Processing 83, R.E.A. Mason (ed.), Elevier Sc. Pub. ( North Holland ), 909–914

4. Fribourg, L.: A Superposition Oriented Theorem Prover, TCS35 (1985), 124–164.

5. H82] Hsiang, J.: Topics in Automated Theorem Proving and Program Generation Ph.D. Thesis, Dec. 1982, University of Illinois at Urbana-Champaign, UIUCDCS-R-82–1113.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Category Theory Framework for Variability Models with Non-functional Requirements;Advanced Information Systems Engineering;2021

2. The term rewriting approach to automated theorem proving;The Journal of Logic Programming;1992-10

3. Eqtheopogles A Completion Theorem Prover for PL1EQ;GWAI-89 13th German Workshop on Artificial Intelligence;1989

4. Opening the AC-unification race;Journal of Automated Reasoning;1988-12