Computing ground reducibility and inductively complete positions-Reference-Cited by-同舟云学术

Computing ground reducibility and inductively complete positions

Published:1989 Issue: Volume: Page:59-75
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Bündgen Reinhard,Küchlin Wolfgang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51081-8_100.pdf

Reference21 articles.

1. Leo Bachmair and Nachum Dershowitz. Critical pair criteria for completion. Journ. Symbolic Computation, 6(1):1–18, August 1988.

2. Robert S. Boyer and J Strother Moore. A Computational Logic. Academic Press, Orlando, Florida, 1979.

3. Reinhard Bündgen. Design, implementation, and application of an extended ground-reducibility test. Master's thesis, Computer and Information Sciences, University of Delaware, Newark, DE 19716, 1987.

4. Technical Report;R. Bündgen,1987

5. B. F. Caviness, editor. Eurocal'85, volume 204 of LNCS. Springer-Verlag, 1985. (European Conference on Computer Algebra, Linz, Austria, April 1985).

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

1. CycleQ: an efficient basis for cyclic equational reasoning;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

2. Test Sets for the Universal and Existential Closure of Regular Tree Languages;Information and Computation;2002-11

3. Test Sets for the Universal and Existential Closure of Regular Tree Languages;Rewriting Techniques and Applications;1999

4. SPIKE-AC: A system for proofs by induction in Associative-Commutative theories;Rewriting Techniques and Applications;1996

5. Automated verification by induction with associative-commutative operators;Computer Aided Verification;1996