Termination of a Set of Rules Modulo a Set of Equations

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

Volumn 170 LNCS, Issue , 1984, Pages 175-193

  Jouannaud, Jean Pierre ^a   Munoz, Miguel ^b  

^a LORIA   (France)

^b UNIVERSITY OF VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHURCH-ROSSER PROPERTY; PETERSON; SET OF RULES; TERMINATION PROBLEMS;

THEOREM PROVING;

EID: 85015764580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-0-387-34768-4_11     Document Type: Conference Paper

References (23)

1. Choque, G., Calcul d’un ensemble complet d’incrémentations minimales pour l’ordre recursif de decomposition. Technical Report, CRIN, Nancy, France, 1983.
2. Dershowitz, N., Ordering for Term-rewriting Systems. Journal of Theoretical Computer Science 17(3):279-301, 1982. Preliminary version in 20th FOCS, 1979.
3. Dershowitz, N., Hsiang, J., Josephson, N. and Plaisted, D. Associate-Commutative Rewriting. Proceedings 10th IJCAI, 1983.
4. Huet, G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of the Association for Computing Machinery 27:797-821, 1980. Preliminary version in 18th FOCS, IEEE, 1977.
5. Huet, G. and Oppen, D., Equations and Rewrite Rules: A Survey. In Book, R. (editor), Formal Language Theory: Perspectives and Open Problems,. Academic Press, 1980.
6. Jouannaud, J.P., Church-Rosser Computations with Equational Term Rewriting Systems. Technical Report, CRIN, Nancy, France, January, 1983. Preliminary version in Proc. 5th CAAP, 1983, to appear in Springer Lecture Notes in Computer Science.
7. Jouannaud, J.P. and Kirchner, H., Completion of a set of rules modulo a set of Equations. Technical Report, SRI-International, 1984. Preliminary version in Proceedings 11th ACM POPL Conference, Salt Lake City, 1984, submitted to the SIAM Journal of Computing.
8. Jouannaud, J.P., Lescanne, P., On Multiset Ordering. Information Processing letters 15(2), 1982.
9. Jouannaud, J.P., Kirchner, C. and Kirchner, H., Algebraic manipulations as a unification and matching strategy for equations in signed binary trees. Proceedings 7th International Joint Conference on Artificial Intelligence, Vancouver, 1981.
10. Jouannaud, J.-P., Lescanne, P., Reinig, F., Recursive Decomposition Ordering. In IFIP Working Conference on Formal Description of Programming Concepts II,. North-Holland, 1983, edited by D. Bjorner., 1983.
11. Kamin, S. and Levy, J.J., Attempts for generalizing the recursive path ordering. 1980. Unpublished draft.
12. Kirchner, C. and Kirchner, H., Resolution d’equations dans les Algebres libres et les varietes equationelles d’Algebres. PhD thesis, Universite Nancy I, 1982.
13. Knuth, D. and Bendix, P., Simple Word Problems in Universal Algebra. In J. Leech (editor), Computational Problems in Abstract Algebra,. Pergamon Press, 1970.
14. Lankford, D. and Ballantyne, A., Decision Procedures for Simple Equational Theories with Commutative Axioms: Complete Sets of Commutative Reductions. Technical Report, Univ. Of Texas at Austin, Dept, of Mathematics and Computer Science, 1977.
15. Lankford, D. and Ballantyne, A., Decision Procedures for Simple Equational Theories with Permutative Axioms: Complete Sets of Permutative Reductions. Technical Report, Univ. Of Texas at Austin, Dept, of Mathematics and Computer Science, 1977.
16. Lankford, D. and Ballantyne, A., Decision Procedures for Simple Equational Theories with Associative Commutative Axioms: Complete Sets of Associative Commutative Reductions. Technical Report, Univ. Of Texas at Austin, Dept, of Mathematics and Computer Science, 1977.
17. Lescanne P., Computer Experiments with the REVE Term Rewriting Systems Generator. In Proceedings, 10th POPL,. ACM, 1983.
18. Lescanne, P., How to prove termination? An approach to the implementation of a new Recursive Decomposition Ordering. Proceedings 6th CAAP, Bordeaux, 1984.
19. Manna, Z. and Ness, N., On the Termination of Markov Algorithms. Proceedings of the third Hawaii Conference on System Sciences, 1970.
20. Munoz, M., Probleme de terminaison finie des systemes de reecriture equationnels. PhD thesis, Universite Nancy 1, 1983.
21. Peterson, G. and Stickel, M., Complete Sets of Reductions for Some Equational Theories., JACM 28:233-264, 1981.
22. Plaisted, D., A Recursively Defined Ordering for Proving Termination of Term Rewriting Systems. Technical Report R-78-943, University of Illinois, Computer Science Department, 1978.
23. Plaisted, D., An associative path ordering. Technical Report, University of Illinois, Computer Science Department, 1983.