A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, LNAI 2083, pages 593--610, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
....i# cap v (w) and s are unifiable by a most general unifier (mgu) such that v and s are in normal form. In Ex. 1, the estimated dependency graph and the estimated innermost dependency graph are identical to the real dependency graph. Alternative approximations of dependency graphs can be found in [14, 22]. A set P #= # of dependency pairs is called a cycle if for any two pairs v and s t in there is a non empty path from v t in the graph which only traverses pairs from P. In our example, we have the cycles (1) 2 = 3) Since we only regard finite TRSs, any infinite ....
A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, LNAI 2083, pages 593--610, 2001.
Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
No context found.
A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, LNAI 2083, pages 593--610, 2001.
Mechanizing Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
No context found.
A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, pages 593--610, 2001. LNAI 2083.
Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
No context found.
A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, LNAI 2083, pages 593--610, 2001.
Modular & Incremental Automated Termination Proofs - Urbain (2004) (Correct)
No context found.
Middeldorp, A.: 2001, `Approximating Dependency Graphs using Tree Automata Techniques '. In: R. Gor, A. Leitsch, and T. Nipkow (eds.): International Joint Conference on Automated Reasoning, Vol. 2083 of Lecture Notes in Artificial Intelligence. Siena, Italy, pp. 593--610.
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