Context-sensitive AC-rewriting

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

Volumn 1631, Issue , 1999, Pages 286-300

  Ferreira, M C F ^a   Ribeiro, A L ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ASSOCIATIVE-COMMUTATIVE; CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; REWRITING MODULO; TERM REWRITING SYSTEMS; TWO WAYS;

ARTIFICIAL INTELLIGENCE;

EID: 84957619369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_24     Document Type: Conference Paper

References (15)

1. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243-320. Elsevier, 1990.
2. M. C. F. Ferreira and A. L. Ribeiro. Context-sensitive AC-rewriting (extended version). Draft, 1999.
3. J.-P. Jouannaud and M. Munoz. Termination of a set of rules modulo a set of equations. In Proc. of the 7th Int. Conf. on Automated Deduction, volume 170 of LNCS, pages 175-193. Springer, 1984.
4. J. W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, volume II, pages 1-116. Oxford University Press, 1992.
5. D. S. Lankford. Canonical inference. Technical Report Memo ATP-36, Automatic Theorem Proving Project, University of Texas, Austin, 1975.
6. S. Lucas. Context-sensitive computations in functional and functional logic programs. The Journal of Functional and Logic Programming, 1998(1):1-61.
7. S. Lucas. Fundamentals of context-sensitive rewriting. In Proc. of the XXII Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'95, volume 1012 of LNCS, pages 405-412. Springer, 1995.
8. S. Lucas. Context-sensitive computations in confluent programs. In Proc. of the 8th Int. Symposium PLILP'96 - Programming Languages: Implementations, Logics, and Programs, volume 1140 of LNCS, pages 408-422. Springer, 1996.
9. S. Lucas. Termination of context-sensitive rewriting by rewriting. In Proc. of the 23rd Int. Colloquium on Automata, Languages and Programming, ICALP96, volume 1099 of LNCS, pages 122-133. Springer, 1996.
10. S. Lucas. Reescritura con Restricciones de Reemplazamiento. PhD thesis, Universidad Politecnica de Valencia, October 1998. In Spanish.
11. Z. Manna and S. Ness. On the termination of Markov algorithms. In Proc. of the 3rd Hawaii Int. Conf. on System Science, pages 789-792, Honolulu, 1970.
12. G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233-264, 1981.
13. D. A. Plaisted. Equational reasoning and term rewriting systems. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, pages 273-364. Oxford Science Publications, Clarendon Press - Oxford, 1993.
14. A. Rubio. A fully syntactic AC-RPO. In this volume.
15. H. Zantema. Termination of context-sensitive rewriting. In Proc. of the 8th Int. Conf. on Rewriting Techniques and Applications, RTA'97, Lecture Notes in Computer Science. Springer, 1997.