Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure-Reference-Cited by-同舟云学术

Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure

Published:2004 Issue: Volume: Page:91-106
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Godoy Guillem,Tiwari Ashish

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25984-8_5.pdf

Reference14 articles.

1. Bachmair, L.: Canonical Equational Proofs. Birkhäuser, Boston (1991)

2. LNAI;L. Bachmair,2000

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available at http://www.grappa.univ-lille3.fr/tata

4. Comon, H., Godoy, G., Nieuwenhuis, R.: The confluence of ground term rewrite systems is decidable in polynomial time. In: 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, Nevada, USA, pp. 298–307 (2001)

5. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Sematics (B), vol. B, pp. 243–320. MIT press/Elsevier (1990)

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

1. Non-Linear Rewrite Closure and Weak Normalization;Journal of Automated Reasoning;2012-09-16

2. Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories;Logical Methods in Computer Science;2010-08-25

3. Undecidable properties of flat term rewrite systems;Applicable Algebra in Engineering, Communication and Computing;2009-04-21

4. Unique Normalization for Shallow TRS;Rewriting Techniques and Applications;2009

5. Confluence of Shallow Right-Linear Rewrite Systems;Computer Science Logic;2005