Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop  Home/Search
Context Related
| uiuc.edu/~nachum/pap...openfinal.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: uiuc.edu/~nachum/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Interest in the theory and applications of rewriting has been growing rapidly, as evidenced in part by four conference proceedings (including this one) [15, 26, 41, 66]; three workshop proceedings [33, 47, 77]; five special journal issues [5, 88, 24, 40, 67]; more than ten surveys [2, 7, 27, 28, 44, 56, 57, 76, 82, 81]; one edited collection of papers [1]; four monographs [3, 12, 55, 65]; and seven books (four of them still in progress) [8, 9, 35, 54, 60, 75, 84]. To encourage and ... (Update)
Context of citations to this paper: More
.... s, many su cient conditions for ensuring CR have been obtained [3, 5 16] However, some important problems concerning CR remain open [2, 4]. In this paper, we focus on CR of left linear TRS s. B.K.Rosen [9] rst proved that a left linear TRS is CR if there exist no critical...
.... most one of them [Berry, 1978] The problem of determining which term rewrite systems can be translated into lambda calculus is open [Dershowitz et al. 1991]. It is known that not all orthogonal systems can be translated, but that all strongly sequential orthogonal constructor...
Cited by: More
Bubbles in Modularity - Massimo Marchiori Department (Correct)
Problems in Rewriting III - Dershowitz, Jouannaud, Klop (1995) (Correct)
Patterns in Words Versus Patterns in Trees: A Brief Survey .. - Kucherov, Rusinowitch (Correct)
Similar documents (at the sentence level):
61.5%: Open Problems in Rewriting - Dershowitz, Jouannaud, Klop (1991) (Correct)
18.8%: The complete list of RTA open problems - Date April Summary (Correct)
15.2%: More Problems in Rewriting - Dershowitz, Jouannaud, Klop (1993) (Correct)
Active bibliography (related documents): More All
2.0: Rewrite Systems - Dershowitz, Jouannaud (1990) (Correct)
0.7: Semantics Of Non-Terminating Systems Through Term Rewriting - Santos, de Barros (1995) (Correct)
0.6: Perpetuality and Uniform Normalization in Orthogonal Rewrite .. - Khasidashvili, al. (1999) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Natural Termination - Dershowitz, Hoot (1995) (Correct)
0.3: Term Rewriting Systems - Klop (1992) (Correct)
0.3: Hierarchical Termination - Dershowitz (1995) (Correct)
Related documents from co-citation: More All
12: Rewrite systems - Dershowitz, Jouannaud - 1990
10: Term rewriting systems - Klop - 1992
9: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Sys.. (context) - Huet - 1980
BibTeX entry: (Update)
Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop (1991). Open Problems in Rewriting. 4 th RTA 1991, LNCS 488, pp. 445-456, Springer-Verlag. http://citeseer.ist.psu.edu/article/dershowitz91open.html More
@inproceedings{ dershowitz91open,
author = "Nachum Dershowitz and Jean-Pierre Jouannaud and Jan Willem Klop",
title = "Open Problems in Rewriting",
booktitle = "Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy)",
volume = "488",
month = "April",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "R. Book",
pages = "445--456",
year = "1991",
url = "citeseer.ist.psu.edu/article/dershowitz91open.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1991
788 Rewrite systems - Dershowitz, Jouannaud - 1990
474 Term rewriting systems - Klop - 1991
474 Term Rewriting Systems - Klop, de Vrijer - 1991
382 Lambda calculi with types - Barendregt - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
210 its Syntax and Semantics (context) - Barendregt, Lambda - 1991
210 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
174 Combinatory reduction systems (context) - Klop - 1980
137 Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
129 Termination of rewriting (context) - Dershowitz - 1987
125 Solving equations in abstract algebras: A rule-based survey .. (context) - Jouannaud, Kirchner - 1991
118 Complete axiomatizations of the algebras of the finite (context) - Maher - 1988
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
85 On Proving Term Rewriting Systems are Noetherian (context) - Lankford - 1979
71 Transfinite reductions in orthogonal term rewriting systems - Kennaway, Klop et al. - 1991
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1990
59 Equational Logic as a Programming Language (context) - O'Donnell - 1985
58 Canonical Equational Proofs (context) - Bachmair - 1991
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Cherifa, Lescanne - 1987
56 of Lecture Notes in Computer Science (context) - Lescanne, Techniques et al. - 1987
56 of Lecture Notes in Computer Science (context) - Jouannaud, Techniques et al. - 1985
55 Completion of a set of rules modulo a set of equations (context) - Jouannaud, Kirchner - 1986
53 Theoretical Computer Science (context) - Dershowitz, Kaplan et al. - 1991
50 Semantic confluence tests and completion methods (context) - Plaisted - 1985
50 Refutational theorem proving using term-rewriting systems (context) - Hsiang - 1985
47 A rationale for conditional equational programming (context) - Dershowitz, Okada - 1990
44 Equational reasoning and term rewriting systems - Plaisted - 1991
42 The theory of ground rewrite systems is decidable (context) - Dauchet, Tison - 1990
33 Sequentiality in Orthogonal Term Rewriting Systems (context) - Klop, Middeldorp - 1989
31 On sufficient completeness and related properties of term re.. (context) - Kapur, Narendran et al. - 1987
31 Canonical Forms in Finitely Presented Algebras (context) - Le Chenadec - 1985
30 A new method for undecidability proofs of first order theori.. - Treinen
29 Term rewriting and equational reasoning (context) - Avenhaus, Madlener - 1990
28 A complete proof of correctness of the Knuth-Bendix completi.. (context) - Huet - 1981
27 Computing unification algorithms (context) - Kirchner - 1986
26 Simulation of Turing machines by a left-linear rewrite rule (context) - Dauchet - 1989
25 Computations in orthogonal term rewriting systems (context) - Huet, L'evy
25 Explicit representation of terms defined by counter examples (context) - Lassez, Marriott - 1987
25 Word problems and a homological finiteness condition for mon.. (context) - Squier - 1991
23 Associative-commutative unification (context) - Fages - 1987
22 Sequential evaluation strategies for parallel-or and related.. (context) - Kennaway - 1989
22 Modular aspects of properties of term rewriting systems rela.. (context) - Middeldorp - 1989
20 Solving inequations in term algebras (context) - Comon - 1990
20 The Church-Rosser property for ground term rewriting systems.. (context) - Oyamaguchi - 1987
19 Decidability of the confluence of finite ground term rewriti.. (context) - Dauchet, Heuillard et al. - 1990
15 Universal unification (context) - Siekmann - 1984
14 Commutativity of term rewriting systems (context) - Toyama - 1988
13 On relationship between term rewriting systems and regular t.. (context) - Kucherov - 1991
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989
13 A refinement of strong sequentiality for term rewriting with.. (context) - Thatte - 1987
13 Unification et Disunification: Th'eorie et Applications (context) - Comon - 1988
12 Complete sets of reductions modulo Associativity (context) - Baird, Peterson et al. - 1989
11 An equational approach to theorem proving in first-order pre.. (context) - Kapur, Narendran - 1985
9 Clausal rewriting (context) - Nieuwenhuis, Orejas - 1990
9 Accessible independence results for Peano arithmetic (context) - Kirby, Paris - 1982
9 Term rewriting systems (context) - Plaisted - 1991
9 Theoretical Computer Science (context) - Bauer, systems - 1985
8 of Lecture Notes in Computer Science (context) - Benninghofen, Kemmerich et al. - 1987
7 A new ac unification algorithm with an algorithm for solving.. (context) - Boudet, Contejean et al. - 1990
7 Conditional rewriting in Focus (context) - Bronsard, Reddy - 1991
7 Bulletin of the European Association for Theoretical Compute.. (context) - Klop, systems et al. - 1987
6 Rewriting: Theory and Applications (context) - Kirchner, Kirchner - 1991
6 Programming with equations (context) - O'Donnell - 1991
6 Inference rules for rewrite-based first-order theorem provin.. (context) - Bachmair, Dershowitz - 1987
6 Bounds on Derivation Lengths from Termination Proofs (context) - Cichon - 1990
6 Topics in completion theorem proving (context) - Muller, Socher-Ambrosius - 1988
5 Conditional rewrite rules: Confluency and termination (context) - Bergstra, Klop - 1986
5 Extending the lambda calculus with surjective pairing is con.. (context) - de Vrijer - 1989
5 Decision problems for term rewriting systems and recognizabl.. (context) - Gilleron - 1991
5 Unique normal forms for Combinatory Logic with Parallel Cond.. (context) - de Vrijer - 1990
4 Completion modulo associativity (context) - Jouannaud, March'e - 1990
4 of Lecture Notes in Computer Science (context) - Dershowitz, International et al. - 1989
4 Well rewrite orderings (context) - Lescanne - 1990
3 Computer Science Laboratory (context) - Dershowitz, Marcus et al. - 1985
3 Resolution of Equations in Algebraic Structures (context) - Ait-Kaci, Nivat - 1989
3 Rewriting Techniques and Applications (context) - Jouannaud - 1987
2 Theoretical Computer Science (context) - Krishnamoorthy, Narendran et al. - 1985
2 Calcul de longueurs de chaines de r'e'ecriture dans le monoi.. (context) - M'etivier - 1985
2 A New Strategy for the Boolean Ring Based Approach to First .. (context) - Zhang - 1991
2 Reduction graphs in the Lambda Calculus (context) - Venturini-Zilli - 1984
2 Mimimal and optimal computations of recursive programs (context) - Berry, L'evy - 1979
2 of Theoretical Computer Science (context) - Lescanne, Techniques et al. - 1989
2 Rewrite Techniques in Theorem Proving (context) - Bachmair, Hsiang - 1991
1 An Introduction to Rewriting (context) - Sleep - 1992
1 Satisfiability of systems of ordinal notations enjoying the .. (context) - Jouannaud, Okada - 1991
1 Rewriting Techniques and Applications III (context) - Dershowitz - 1992
1 Computing the Lexicographic Path Ordering (context) - Snyder - 1990
1 Term Rewriting (context) - Thomas - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sal.cs.uiuc.edu/~nachum/papers/): More
Hierarchical Termination - Dershowitz (1995) (Correct)
Logical Debugging - Lee, Dershowitz (Correct)
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ... - Dershowitz, al. (1989) (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