Date: April 1991 Summary: Which rewrite systems can be directly de ned in...  Home/Search
Context
Related
| lsv.enscachan.fr/~tre...complete.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: lsv.enscachan.fr/~treinen/rta... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: um ? (A rewrite system is \non-erasing" if both sides of each rule have exactly the same variables.) The same questions can be asked for the spectrum obtained for orthogonal systems by dividing out the ner notion of \permutation equivalence" due to J.-J. Levy (see [BL79][Klo80][Klo92]). Date: April 1991 Summary: What is the complexity of deciding ground-reducibility? A term t is ground reducible with respect to a rewrite system R if all its ground (variable-free) instances contain a redex. ... (Update)
Similar documents (at the sentence level):
10.3%: Open Problems in Rewriting - Dershowitz, Jouannaud, Klop (1991) (Correct)
9.1%: Problems in Rewriting III - Dershowitz, Jouannaud, Klop (1995) (Correct)
8.6%: More Problems in Rewriting - Dershowitz, Jouannaud, Klop (1993) (Correct)
Active bibliography (related documents): More All
1.7: On Rewrite Constraints and Context Unification - Niehren, Tison (2000) (Correct)
1.4: Type Theory and Rewriting - BLANQUI (2001) (Correct)
1.3: Unique normal form property of compatible term rewriting.. - Mano, Ogawa (1999) (Correct)
Similar documents based on text: More All
0.1: Improved Response-Time Analysis Calculations - Sjödin, Hansson (1998) (Correct)
0.1: Making Locally Optimal Decisions on Graphs with Cycles - Pemberton, Korf (1992) (Correct)
0.1: Wavelength Shifting in Ultra-Thin - Is Changed From (Correct)
BibTeX entry: (Update)
@misc{ summary-complete,
author = "Date April Summary",
title = "The complete list of RTA open problems",
url = "citeseer.ist.psu.edu/700125.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
382 Lambda calculi with types - Barendregt - 1991
251 A logic programming language with lambdaabstraction - Miller - 1991
210 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
126 Higher-order critical pairs (context) - Nipkow
116 volume 914 of Lecture Notes in Computer Science (context) - Hsiang, th et al. - 1995
116 volume 607 of Lecture Notes in Computer Science (context) - Kapur, th et al. - 1992
116 volume 1833 of Lecture Notes in Computer Science (context) - Bachmair, Techniques - 2000
116 volume 488 of Lecture Notes in Computer Science (context) - Book, th et al. - 1991
111 Solving systems of set constraints (context) - Aiken, Wimmers
105 The problem of solvability of equations in a free semi-group (context) - Makanin - 1977
102 Computations in orthogonal rewriting systems (context) - erard, Jean-Jacques et al. - 1991
102 Computations in orthogonal rewriting systems (context) - erard, Jean-Jacques et al. - 1991
102 Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987
85 On proving term rewriting systems are Noetherian (context) - Lankford - 1979
82 A decision procedure for a class of set constraints - Heintze, Ja
77 String-Rewriting Systems (context) - Book, Otto - 1993
76 Set constraints are the monadic class - Bachmair, Ganzinger et al. - 1993
75 Completion of rewrite systems with membership constraints - Comon - 1998
75 Completion of rewrite systems with membership constraints - Comon - 1998
75 Completion of rewrite systems with membership constraints - Comon - 1991
73 Modularity of simple termination of term rewriting systems w.. (context) - Kurihara, Ohuchi - 1992
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1990
62 Term rewriting systems (context) - Klop - 1992
58 The expression of graph properties and graph transformations.. - Courcelle - 1997
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Cherifa, Lescanne - 1987
54 Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1989
53 Theoretical Computer Science (context) - Dershowitz, ephane et al. - 1991
52 Decidability of systems of set constraints with negative con.. - Aiken, Kozen et al. - 1993
50 Refutational theorem proving using term-rewriting systems (context) - Hsiang - 1985
50 Solving systems of set constraints with negated subset relat.. (context) - emy, Sophie et al. - 1993
48 Completeness of combinations of constructor systems - Middeldorp, Toyama
47 A rationale for conditional equational programming (context) - Dershowitz, Okada - 1990
44 Set constraints with projections are in NEXPTIME - Charatonik, Pacholski - 1994
44 Combination techniques for non-disjoint equational theories - Domenjoud, Klay et al. - 1994
42 Negative set constraints with equality - Charatonik, Pacholski
41 A precedence-based total AC-compatible ordering (context) - Nieuwenhuis
38 Simple LPO constraint solving methods - Nieuwenhuis - 1993
37 Third order matching is decidable - Dowek - 1993
34 Solving systems of set constraints using tree automata (context) - emy, Sophie et al. - 1993
32 Logical Foundations of Functional Programming (context) - erard, editor - 1990
31 Total termination of term rewriting (context) - Ferreira, Zantema - 1996
31 Total termination of term rewriting (context) - Ferreira, Zantema
28 A complete proof of correctness of the KnuthBendix completio.. (context) - erard - 1981
28 Combination of constraint solvers for free and quasi-free st.. (context) - Baader, Schulz - 1998
27 the combination of symbolic constraints (context) - Baader, Schulz - 1995
26 Combination techniques and decision problems for disuni cati.. - Baader, Schulz
26 Simulation of Turing machines by a left-linear rewrite rule (context) - Dauchet
24 Modular properties of conditional term rewriting systems (context) - Middeldorp - 1993
24 A sequential reduction strategy - Antoy, Middeldorp - 1996
23 The undecidability of the second-order uni cation problem (context) - Goldfarb - 1981
22 Modular aspects of properties of term rewriting systems rela.. (context) - Middeldorp
22 Sequential evaluation strategies for parallelor and related .. (context) - Kennaway - 1989
21 Adding algebraic rewriting to the untyped lambda calculus - Dougherty
21 Con- uence properties of weak and strong calculi of explicit.. (context) - Curien, Hardin et al. - 1992
20 Con uent reductions: Abstract properties and applications to.. (context) - erard - 1980
20 Higher-order matching and tree automata - Comon, Jurski - 1997
20 Solving inequations in term algebras (context) - Comon
20 Simulation of Turing machines by a regular rewrite rule (context) - Dauchet - 1992
20 The Church-Rosser property for ground term rewriting systems.. (context) - Oyamaguchi - 1987
19 Ground reducibility is EXPTIME-complete - Comon, Jacquemard - 2003
19 Relative Termination (context) - Geser - 1990
19 Ground reducibility is EXPTIME-complete - Comon, Jacquemard
18 Decision problems in ordered rewriting - Comon, Narendran et al. - 1998
18 volume 39 of North Holland Mathematical Library (context) - Freyd, Scedrov et al. - 1990
18 Sequentiality in orthogonal term rewriting systems (context) - Klop, Middeldorp - 1991
18 Complete axiomatizations of the algebras of the nite (context) - Maher - 1988
17 Complement problems and tree automata in AC-like theories (context) - Lugiez, Moysset - 1993
17 Personal communication (context) - Mano - 1993
17 Complete axiomatizations of some quotient term algebras - Comon - 1993
16 Monadic-second order graph transductions: A survey (context) - Courcelle - 1994
15 On termination of one rule rewrite systems - Lescanne - 1992
15 Termination of rewrite systems by elementary interpretations (context) - Lescanne - 1992
15 The theory of ground rewrite systems is decidable (context) - Dauchet, Tison
15 Unique normal forms in term rewriting systems with repeated .. (context) - Chew - 1981
13 On relationship between term rewriting systems and regular t.. (context) - Kucherov
13 A new method for establishing refutational completeness in t.. (context) - Hsiang, Rusinowitch - 1986
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989
13 Combining term rewriting and type assignment systems (context) - Barbanera - 1990
12 Makanin's algorithm (context) - Diekert - 2001
12 Complete sets of reductions modulo Associativity (context) - Baird, Peterson et al.
11 Explicit representation of terms de ned by counter examples (context) - Lassez, Marriott - 1987
10 Linear second-order uni cation - Levy
10 A method for enumerating cosets of a group presented by a ca.. (context) - Kuhn, Madlener - 1989
10 Paramodulation with non-monotonic orderings - ll, Godoy et al. - 1999
9 Accessible independence results for Peano arithmetic (context) - Kirby, Paris - 1982
9 Clausal rewriting (context) - Nieuwenhuis, Orejas - 1990
9 the word problem for right-ground term-rewriting systems (context) - Oyamaguchi - 1990
9 De nitions by rewriting in the Calculus of Constructions (context) - Blanqui - 2003
9 Equational Logic as a Programming Language (context) - O'Donnell - 1985
9 volume 1103 of Lecture Notes in Computer Science (context) - Ganzinger, th et al. - 1996
9 Theoretical Computer Science (context) - Bauer, systems - 1985
8 Con uence and preservation of strong normalisation in an exp.. (context) - esar - 1996
8 On equality up-to constraints over nite trees (context) - Niehren, Pinkal et al. - 1997
8 Decidability of regularity and related properties of ground .. - Kucherov, Tajine
8 A decision procedure for the existential theory of term alge.. - Korovin, Voronkov - 2000
8 volume 127 of Mathematical Centre Tracts (context) - Klop, Systems - 1980
8 the uniform halting problem for term rewriting systems (context) - erard, Dallas et al. - 1978
8 Encompassment properties and automata with constraints (context) - ecile, Jean-Luc et al.
8 Solving linear Diophantine constraints incrementally - Contejean - 1993
7 Decidability of the con uence of nite ground term rewriting .. (context) - Dauchet, Heuillard et al. - 1990
7 reprinted in Rewriting Techniques and Applications (context) - Dershowitz, rewriting et al. - 1987
7 Description Abstraite des Systemes de Reecriture (context) - Melli - 1996
7 The rst-order theory of lexicographic path orderings is unde.. (context) - Comon, Treinen - 1997
7 Bi-rewriting systems (context) - Levy, Agust - 1996
7 Conditional rewriting in Focus (context) - Bronsard, Reddy - 1991
6 Completion of a set of rules modulo a set of equations (context) - Jouannaud, el et al. - 1986
6 Solving equations in abstract algebras: A rule-based survey .. (context) - Jouannaud, Kirchner - 1991
6 Solving equations in abstract algebras: A rule-based survey .. (context) - Jouannaud, Kirchner - 1991
6 Knuth-Bendix constraint solving is NP-complete (context) - Korovin, Voronkov - 2001
6 A new proof of Chew's theorem - Mano, Ogawa - 1994
6 Topics in completion theorem proving (context) - urgen, uller et al. - 1988
6 Sequent combinators: A Hilbert system for the lambda calculu.. - Goguen, Goubault-Larrecq - 2000
6 Bounds on derivation lengths from termination proofs (context) - Cichon - 1990
6 Automates d'arbres et Reecriture de termes (context) - Jacquemard - 1996
6 Con uence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
6 Rewrite systems for varieties of semigroups (context) - Baader - 1990
6 Relative undecidability in the termination hierarchy of sing.. - Geser, Middeldorp et al.
5 Decision problems for term rewriting systems and recognizabl.. (context) - Gilleron - 1991
5 Computing linearizations using test sets (context) - Hofbauer, Huber
5 AC-complement problems: Validity and negation elimination (context) - Fern
5 Modularity of strong normalization and con uence in the - a.. (context) - Barbanera, Fern et al.
5 Conditional term graph rewriting - Ohlebusch - 1997
5 the uniquely converging property of nonlinear term rewriting.. - Ogawa, Ono - 1989
5 Trans nite reductions in orthogonal term rewriting systems (context) - Kennaway, Klop et al. - 1990
5 Trans nite reductions in orthogonal term rewriting systems (context) - Kennaway, Klop et al.
5 Theoretical Computer Science (context) - van Oostrom - 1997
5 A superposition oriented theorem prover (context) - Fribourg - 1985
5 Innocuous constructor-sharing combinations - Dershowitz
4 Undecidability of the rst order theory of one-step right gro.. (context) - Marcinkowski
4 On su- cient completeness and related properties of term rew.. (context) - Kapur, Narendran et al. - 1987
4 Implementing term rewriting by jungle evaluation - Ho, Plump - 1991
4 Well rewrite orderings (context) - Lescanne
4 volume 1232 of Lecture Notes in Computer Science (context) - Comon, th et al. - 1997
4 Personal communication (context) - Comon - 1993
4 volume 690 of Lecture Notes in Computer Science (context) - Kirchner, th et al. - 1993
4 the ground reducibility problem for word rewriting systems w.. (context) - Kucherov, Rusinowitch - 1994
4 Computing uni cation algorithms (context) - Kirchner - 1986
3 Computer Science Laboratory (context) - Dershowitz, Marcus et al. - 1985
3 On subsemigroups and ideals in free products of semigroups (context) - Campbell, Robertson et al. - 1996
3 volume 1214 of Lecture Notes in Computer Science (context) - Bidoit, Dauchet et al. - 1997
3 Using Term Orders to Control Deductions (context) - Bronsard - 1995
3 Dehn functions and l1-norms of nite presentations (context) - Gersten - 1992
3 Simultaneous critical pairs and church-rosser property - Okui
3 The calculus of explicit substitutions - Lescanne, Rouyer-Degli - 1994
3 Currying second-order uni- cation problems (context) - Levy, Villaret - 2002
3 Extending the lambda calculus with surjective pairing is con.. (context) - de Vrijer - 1989
3 Problem corner: An experiment with Grau's ternary Boolean al.. (context) - Christian
3 Con uence by decreasing diagrams (context) - van Oostrom - 1992
3 Uni cation in the union of disjoint equational theories: Com.. (context) - Baader, Schulz
3 Linear higher-order matching is NPcomplete (context) - de Groote
3 Personal communication (context) - March - 1993
3 Semantic con uence tests and completion methods (context) - Plaisted
3 Applicable Algebra in Engineering (context) - Middeldorp, Gramlich et al. - 1995
3 Combination of constraint solving techniques: An algebraic p.. (context) - Baader, Schulz
3 AC-uni cation of higher-order patterns (context) - Boudet, Contejean - 1997
3 Call by need computations in non-ambiguous linear term rewri.. (context) - Huet, Lvy - 1979
3 The con uence of ground term rewrite systems is decidable in.. (context) - Comon, Godoy et al. - 2001
3 Automatic monoids versus monoids with nite convergent presen.. (context) - Otto, Sattler-Klein et al.
3 the Church-Rosser property of simple-right-linear term rewri.. (context) - Ohta, Oyamaguchi et al.
2 Deciding the satis ability of quanti er free formulae on one.. (context) - ecile, Franck et al.
2 Uni cation algorithms cannot be combined in polynomial time (context) - Hermann, Kolaitis
2 personal communication (context) - Freese - 1993
2 the modularity of con uence of constructor-sharing term rewr.. (context) - Ohlebusch - 1994
2 the modularity of con uence of constructor-sharing term rewr.. (context) - Ohlebusch - 1994
2 A new result about the decidability of the existential one-s.. (context) - ebastien, Pierre et al.
2 Modularity of termination and con uence in combinations of r.. (context) - Barbanera, Fern - 1993
2 Transactions of the American Mathematical Society (context) - Kruskal, the et al. - 1960
2 Cycle uni cation (context) - Bibel, olldobler et al.
2 Personal communication (context) - Devienne - 1993
2 Mimimal and optimal computations of recursive programs (context) - erard, Jean-Jacques et al. - 1979
2 Completion modulo associativity (context) - Jouannaud, March - 1990
2 Theoretical Computer Science (context) - Krishnamoorthy, Narendran et al. - 1985
2 Con uence of the lambda calculus with left-linear algebraic .. (context) - uller - 1992
2 An equational approach to theorem proving in rst-order predi.. (context) - Kapur, Narendran - 1985
2 Unique normal forms for Combinatory Logic with parallel cond.. (context) - de Vrijer - 1990
2 Generalizations of the Kruskal-Friedman theorems (context) - Gordeev - 1990
2 Finite family developments - van Oostrom
2 Reduction techniques for rstorder reasoning (context) - Bronsard, Reddy
2 A self-interpreter of lambda calculus having a normal form (context) - Berarducci, ohm - 1992
2 syntactic equational theories (context) - Boudet, Contejean - 1992
2 ACuni cation (context) - Boudet, Contejean
2 A new AC uni cation algorithm with an algorithm for solving .. (context) - Boudet, Contejean et al.
2 Inference rules for rewrite-based rst-order theorem proving (context) - Bachmair, Dershowitz - 1987
2 A new parallel closed condition for Church-Rosser of left-li.. - Oyamaguchi, Ohta
1 Termination of string rewriting rules that have one pair of .. - Geser - 2003
1 The decidability of the rst-order theory of the Knuth-Bendix.. (context) - Korovin, Voronkov - 2002
1 uni cation based on a reduction to AC1-uni cation (context) - Contejean, solution et al. - 1993
1 ements pour la Decidabilite de l'Uni cation modulo la Dist.. (context) - Contejean - 1992
1 De nitions and comparisons of local computations on graphs (context) - Litovski, etivier et al.
1 Termination und Kon uenz von Semi-Thue-Systems mit nur einer.. (context) - Kurth - 1990
1 Une approche algebrique de la reecriture de preuves equa.. (context) - Devie - 1991
1 Normal forms and reduction for theories of binary relations - Dougherty, Gutirrez
1 Filtrage d'ordre suprieure (context) - Padovani - 1996
1 An ecient representation of arithmetic for term rewriting (context) - Cohen, Watson
1 Conjunctive types and SKInT - Goubault-Larrecq - 1999
1 Characterizing Con uence by Rewrite Closure and Right Ground.. (context) - Godoy, Tiwari et al. - 2004
1 Calcul de longueurs de cha^nes de reecriture dans le mono.. (context) - etivier - 1985
1 XJones and Bartlett Publishers (context) - Epstein, In - 1992
1 calculi with explicit substitutions may not terminate (context) - Mellis - 1995
[Article contains additional citations not shown here]
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