Confluence of terminating conditional rewrite systems revisited

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

Volumn 1103, Issue , 1996, Pages 245-259

  Gramlich, Bernhard ^a   Wirth, Claus Peter ^b  

^a INRIA   (France)

^b University of Koblenz Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONDITIONAL REWRITE SYSTEMS; CONDITIONAL TERM REWRITING SYSTEMS; JOINABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 84957684210     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_56     Document Type: Conference Paper

References (13)

1. J. Avenhaus and C. Loría-Sáenz. On conditional rewrite systems with extra variables and deterministic logic programs. In F. Pfenning, ed., Proc. 5th LPAR, LNAI 822, pp. 215-229, Springer-Verlag, 1994.
2. L. Bachmair and N. Dershowitz. Critical pair criteria for completion. Journal of Symbolic Computation, 6(1):1-18, 1988.
3. J. Bergstra and J. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32:323-362, 1986.
4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Formal models and semantics, Handbook of Theoretical Computer Science, vol. B, ch. 6, pp. 243-320. Elsevier - The MIT Press, 1990.
5. N. Dershowitz, M. Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In S. Kaplan and J.-P. Jouannaud, eds., Proc. 1st CTRS (1987), LNCS 308, pp. 31-44, Springer-Verlag, 1988.
6. B. Gramlich. On termination and confluence of conditional rewrite systems. In N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th CTRS (1994), LNCS 968, pp. 166-185. Springer-Verlag, 1995.
7. B. Gramlich. Confluence without termination via parallel critical pairs. In H. Kirchner, ed., Proc. 21st CAAP, LNCS 1059, pp. 211-225. Springer-Verlag, 1996.
8. S. Kaplan, Conditional rewrite rules. TCS, 33:175-193, 1984.
9. D. Kapur, D. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. JSC, 1988(6):19-36, 1988.
10. J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, vol. 2, ch. 1, pp. 2- 117. Clarendon Press, Oxford, 1992.
11. T. Suzuki, A. Middeldorp, and T. Ida. Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In J. Hsiang, ed., Proc. 6th RTA, LNCS 914, pp. 179-193, Kaiserslautern, Springer-Verlag, 1995.
12. C.-P. Wirth. Syntactic confluence criteria for constructor-based positive/negative- conditional term rewriting systems. SEKI-Report SR-95-09, Fachbereich Informatik, Universitãt Kaiserslautern, 1995.
13. C.-P. Wirth and B. Gramlich. A constructor-based approach for positive/negative conditional equational specifications. JSC, 17:51-90, 1994.