Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering-Reference-Cited by-同舟云学术

Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering

Published:2013 Issue: Volume: Page:311-326
ISSN:0302-9743
Container-title:Frontiers of Combining Systems
language:
Short-container-title:

Author:

Aoto Takahito

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40885-4_22

Reference35 articles.

1. Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Proc. of 21st RTA. LIPIcs, vol. 6, pp. 7–16. Schloss Dagstuhl (2010)

2. Aoto, T., Toyama, Y.: A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. Logical Methods in Computer Science 1(31), 1–29 (2012)

3. Lecture Notes in Computer Science;T. Aoto,2009

4. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)

5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)

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

1. A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

2. Term Orderings for Non-reachability of (Conditional) Rewriting;Automated Reasoning;2022

3. Proving semantic properties as first-order satisfiability;Artificial Intelligence;2019-12

4. Use of logical models for proving infeasibility in term rewriting;Information Processing Letters;2018-08

5. Analysis of Rewriting-Based Systems as First-Order Theories;Logic-Based Program Synthesis and Transformation;2018