Commutation, transformation, and termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 230 LNCS, Issue , 1986, Pages 5-20

  Bachmair, Leo ^a   Dershowitz, Nachum ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASSOCIATIVE-COMMUTATIVE; COMBINED SYSTEM; REWRITE SYSTEMS; TERMINATION METHOD; TRANSFORMATION TECHNIQUES;

THEOREM PROVING;

EID: 84976681515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16780-3_76     Document Type: Conference Paper

References (21)

1. Bachmair, L., and Plaisted, D.A. (1985). Termination orderings for associative- commutative rewriting systems, J. of Symbolic Computation 1, 329-349.
2. Ben Cherifa, A., and Lescanne, P. (1985). A method for proving termination of rewriting systems based on elementary computations on polynomials, unpublished manuscript.
3. Dershowitz, N. (1981). Termination of linear rewriting systems, Proc. 8th EATCS Int. Col-loquium on Automata, Languages and Programming, S. Even and O. Kariv, eds., Lect. Notes in Comp. Science 115, New York, Springer, 448-458.
4. Dershowitz, N. (1982). Orderings for term-rewriting systems, Theoretical Computer Science 17, 279-301.
5. Dershowitz, N. (1985a). Computing with rewrite systems, Information and Control 64, 122-157.
6. Dershowitz, N. (1985b). Termination. Proc. 1st Int. Conf. on Rewriting Techniques and Applications, Dijon, France, Lect. Notes in Comp. Science, Springer, 180-224.
7. Dershowitz, N., Hsiang, J., Josephson, N.A., and Plaisted, D.A. (1984). Associative-commutative rewriting. Proc. 8th IJCAI, Karlsruhe, 940-944.
8. Guttag, J.V., Kapur, D., and Musser, D.R. (1983). On proving uniform termination and restricted termination of rewriting systems. SIAM Computing 12, 189-214.
9. Hsiang, J. (1985). Refutational theorem proving using term-rewriting systems. Artificial Intelligence 25, 255-300.
10. Huet, G. (1980). Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27, 797-821.
11. Huet, G. and Hullot, J.M. (1982). Proofs by induction in equational theories with constructors. J. of Comp, and System Sciences 25, 239-266.
12. Jouannaud, J.-P., and Munoz, M. (1984). Termination of a set of rules modulo a set of equations, Proc. 7th Int. Conf. on Automated Deduction, R. Shostak, ed., Lect. Notes in Comp. Science 170, Berlin, Springer, 175-193.
13. Kamin, S., and Levy, J.J. (1980). Two generalizations of the recursive path ordering. Unpublished manuscript, Univ. of Illinois at Urbana-Champaign.
14. Kapur, D., and Sivakumar, G. (1984). Architecture of and experiments with RRL, a rewrite rule laboratory. Proc. NSF Workshop on the Rewrite Rule Laboratory, Rensellaer-ville, New York, 33-56.
15. Lankford, D.S. (1979). On proving term rewriting systems are noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. Univ., Ruston, Louisiana.
16. Manna, Z., and Ness, S. (1970). On the termination of Markov algorithms. Proc. Third Hawaii Int. Conf. on System Science, 789-792.
17. Musser, D.R. (1980). On proving inductive properties of abstract data types. Proc. 7th ACM Symp. on Principles of Programming Languages, Las Vegas, 154-162.
18. O’Donnell, M.J. (1985). Equational logic as a programming language. MIT Press, Cambridge, Massachusetts.
19. Plaisted, D.A. (1984). Associative path orderings, Proc. NSF Workshop on the Rewrite Rule Laboratory, Rensellaerville, New York, 123-126.
20. Raoult, J.C., and Vuillemin, J. (1980). Operational and semantic equivalence between recursive programs, J. ACM 27, 772-796.
21. Rosen, B. (1973). Tree-manipulating systems and Church-Rosser theorems, J. ACM 20, 160-187.