Ashish Tiwari  Home/Search
Context Related
| sri.com/~tiwari/lics02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sri.com/users/tiwari/lics02 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a polynomial time algorithm for deciding confluence of ground rewrite systems was open for a long time... (Update)
Cited by: More
On the Confluence of Linear Shallow Term Rewrite Systems - Godoy, Tiwari, Verma (2003) (Correct)
Active bibliography (related documents): More All
1.7: Deciding Confluence of Certain Term Rewriting Systems in.. - Tiwari (2002) (Correct)
0.3: Rewrite Closure for Ground and Cancellative AC Theories - Tiwari (2001) (Correct)
0.2: Rewrite Closures for Ground and Cancellative AC Theories - Tiwari (2001) (Correct)
Similar documents based on text: More All
0.4: Classes of Term Rewrite Systems with Polynomial.. - Godoy, Nieuwenhuis.. (2002) (Correct)
0.4: Termination of Linear Programs - Tiwari (2004) (Correct)
0.4: Approximate Reachability for Linear Systems - Tiwari (Correct)
BibTeX entry: (Update)
A. Tiwari. Deciding confluence of certain term rewriting systems in polynomial time. In Gordon Plotkin, editor, IEEE Symposium on Logic in Computer Science, LICS 2002, pages 447--456. IEEE Society, 2002. http://citeseer.ist.psu.edu/article/tiwari02deciding.html More
@misc{ tiwari02deciding,
author = "A. Tiwari",
title = "Deciding confluence of certain term rewriting systems in polynomial time",
text = "A. Tiwari. Deciding confluence of certain term rewriting systems in polynomial
time. In Gordon Plotkin, editor, IEEE Symposium on Logic in Computer Science,
LICS 2002, pages 447--456. IEEE Society, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/tiwari02deciding.html" }
Citations (may not include all citations):214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
102 Tree automata techniques and applications - Comon, Dauchet et al. - 1997
82 Variations on the common subexpressions problem (context) - Downey, Sethi et al. - 1980
20 The Church-Rosser property for ground term rewriting systems.. (context) - Oyamaguchi - 1987
19 Decidability of the confluence of finite ground term rewrite.. (context) - Dauchet, Heuillard et al. - 1990
15 The theory of ground rewrite systems is decidable (context) - Dauchet, Tison - 1990
14 A fast algorithm for generating reduced ground rewriting sys.. (context) - Snyder - 1993
9 Abstract congruence closure (context) - Bachmair, Tiwari et al. - 2002
8 Congruence closure modulo associativity and commutativity - Bachmair, Ramakrishnan et al. - 2000
5 Rewrite closure for ground and cancellative AC theories - Tiwari - 2001
3 The confluence of ground term rewrite systems is decidable i.. - Comon, Godoy et al. - 2001
3 the complexity of confluence for ground rewrite systems (context) - Hayrapetyan, Verma - 2001
3 the combination of equational and rewrite theories induced b.. (context) - Tiwari - 2002
Documents on the same site (http://www.csl.sri.com/users/tiwari/lics02.html):
Deciding Confluence of Certain Term Rewriting Systems in.. - Tiwari (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC