Automated deduction with associative-commutative operators-Reference-Cited by-同舟云学术

Automated deduction with associative-commutative operators

Published:1995-01 Issue:1 Volume:6 Page:23-56
ISSN:0938-1279
Container-title:Applicable Algebra in Engineering, Communication and Computing
language:en
Short-container-title:AAECC

Author:

Rusinowitch Micha�l,Vigneron Laurent

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF01270929.pdf

Reference34 articles.

1. Anantharaman, S., Hsiang, J., Mzali, J.: Sbreve2: A term rewriting laboratory with (AC-)unfailing completion. In: Dershowitz, N. (ed) Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N.C., USA), vol. 355. Lecture Notes in Computer Science, pp. 533?537. Berlin, Heidelberg, New York: Springer 1989

2. Bachmair, L., Dershowitz, N.: Completion for rewriting modulo a congruence. Theoret. Comput. Sci.67(2?3), 173?202 (1989)

3. Bachmair, L., Ganzinger, H.: On restrictions of ordered paramodulation with simplification. In: Stickel, M. E. (ed) Proceedings 10th International Conference on Automated Deduction, Kaiserslautern (Germany), vol. 449. Lecture Notes in Computer Science, pp. 427?411. Berlin, Heidelberg, New York: Springer 1990

4. Bürckert, H.-J., Herold, A., Kapur, D., Siekmann, J., Stickel, M. E., Tepp, M., Zhang, H.: Opening the AC-unification race. J. Automated Reasoning4(1), 465?474 (1988)

5. Bachmair, L., Plaisted, D.: Associative path orderings. In: Proceedings 1st Conference on Rewriting Techniques and Applications, Dijon (France), vol. 202. Lecture Notes in Computer Science. Berlin, Heidelberg, New York: Springer 1985

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

1. Paramodulation with Well-founded Orderings;Journal of Logic and Computation;2008-08-14

2. On the Complexity of Equational Horn Clauses;Automated Deduction – CADE-20;2005

3. An Overview of MSR( );Electronic Notes in Theoretical Computer Science;2002-11

4. ELAN from a rewriting logic point of view;Theoretical Computer Science;2002-08

5. Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II);Journal of Symbolic Computation;2002-06