On fairness of completion-based theorem proving strategies-Reference-Cited by-同舟云学术

On fairness of completion-based theorem proving strategies

Published:1991 Issue: Volume: Page:348-360
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Bonacina Maria Paola,Hsiang Jieh

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-53904-2_109.pdf

Reference14 articles.

1. L.Bachmair, N.Dershowitz, J.Hsiang, Orderings for Equational Proofs, in Proceedings of the First Annual IEEE Symposium on Logic in Computer Science, 346–357, Cambridge, MA, June 1986.

2. L. Bachmair, Proofs Methods for Equational Theories, Ph.D. thesis, Department of Computer Science, University of Illinois, Urbana, IL., 1987.

3. L. Bachmair, N. Dershowitz and D.A. Plaisted, Completion without failure, in H. Ait-Kaci, M. Nivat (eds.), Resolution of Equations in Algebraic Structures, Vol. II: Rewriting Techniques, 1–30, Academic Press, New York, 1989.

4. L.Bachmair, H.Ganzinger, Completion of First-Order Clauses with Equality by Strict Superposition, to appear in M.Okada, S.Kaplan (eds.), Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990.

5. M.P.Bonacina, J.Hsiang, Completion Procedures as Semidecision Procedures, to appear in M.Okada, S.Kaplan (eds.), Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Montreal, Canada, June 1990.

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

1. Goal-Sensitive Reasoning with Disconnection Tableaux;Lecture Notes in Computer Science;2017

2. Relative Termination via Dependency Pairs;Journal of Automated Reasoning;2016-04-30

3. On fairness in distributed automated deduction;Lecture Notes in Computer Science;1993

4. A goal oriented strategy based on completion;Algebraic and Logic Programming