Proof by consistency in conditional equational theories-Reference-Cited by-同舟云学术

Proof by consistency in conditional equational theories

Published:1991 Issue: Volume: Page:194-205
ISSN:0302-9743
Container-title:Conditional and Typed Rewriting Systems
language:
Short-container-title:

Author:

Bevers Eddy,Lewi Johan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54317-1_91.pdf

Reference33 articles.

1. Ackermann, W. (1962). Solvable cases of the decision problem. North-Holland.

2. Bachmair, L. (1988). Proof by Consistency in Equational Theories. Logic in Computer Science, Edinburgh 1988.

3. Bachmair, L., Ganzinger, H. (1990). Completion of first-order clauses with equality by strict superposition. 2nd CTRS, Logic and Formal Method Lab, Dept. of Computer Science, Concordia University, Montreal.

4. Bergstra, J., Klop, J.W. (1982). Conditional rewrite rules: Confluence and termination. Report IW198/82, Mathematisch Centrum, Amsterdam.

5. Bevers, E., Lewi, J. (1990). Proof by Consistency in Conditional Equational Theories. Report CW 102, Department of Computer Science, K.U.Leuven.

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

1. History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!;Lecture Notes in Computer Science;2005

2. Higher-order proof by consistency;Lecture Notes in Computer Science;1996

3. Induction using term orderings;Automated Deduction — CADE-12;1994

4. On notions of inductive validity for first-order equational clauses;Automated Deduction — CADE-12;1994

5. On the connection between narrowing and proof by consistency;Automated Deduction — CADE-12;1994