| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Deepak Kapur, Hantao Zhang 0001 |
An Overview of Rewrite Rule Laboratory (RRL).  |
RTA  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Göttler |
Graph Grammars, A New Paradigma for Implementing Visual Languages. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
CR classification system (1987): D.1 Programming Techniques D.2.1 Requirements/Specification, D.2.2 Tools and Techniques, D.2.6 Programming Environments, E.1 Data Structures, F.4.2 Grammars and other Rewriting Systems - additional: Graph Grammars, Syntax-directed Editors, Diagram Languages |
| 1 | Dallas Lankford |
Generalized Gröbner Bases: Theory and Applications. A Condensation. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt |
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Habib Abdulrab, Jean-Pierre Pécuchet |
Solving Systems of Linear Diophantine Equations and Word Equations. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach |
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Snyder |
Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | R. C. Sekar 0001, Shaunak Pawagi, I. V. Ramakrishnan |
Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Dauchet |
Simulation of Turning Machines by a Left-Linear Rewrite Rule. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Bachmair |
Proof Normalization for Resolution and Paramodulation. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | George F. McNulty |
An Equational Logic Sampler. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei G. Vorobyov |
Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Baader |
Characterization of Unification Type Zero. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Paola Bonacina, Giancarlo Sanna |
KBlab: An Equational Theorem Prover for the Macintosh. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Tison |
Fair Termination is Decidable for Ground Systems. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Siva Anantharaman, Jieh Hsiang, Jalel Mzali |
SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hessam Khoshnevisan, K. M. Sephton |
InvX: An Automatic Function Inverter. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Avenhaus, Jörg Denzinger, Jürgen Müller 0007 |
THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Inductive Proofs by Specification Transformation. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Garrett Birkhoff |
Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture). |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Conal Elliott |
Higher-order Unification with Dependent Function Types. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | John Pedersen |
Morphocompletion for One-Relation Monoids. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurence Puel |
Embedding with Patterns and Associated Recursive Path Ordering. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Bidoit, Francis Capy, Christine Choppy |
ASSPEGIQUE: An Integrated Specification Environment. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Uday S. Reddy |
Rewriting Techniques for Program Synthesis. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Nipkow |
Combining Matching Algorithms: The Rectangular Case. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chilukuri K. Mohan |
Priority Rewriting: Semantics, Confluence, and Conditional. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chilukuri K. Mohan, Mandayam K. Srivas |
Negation with Logical Variables in Conditional Rewriting. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjai Narain |
Optimization by Non-Deterministic, Lazy Rewriting. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hantao Zhang 0001, Deepak Kapur |
Consider Only General Superpositions in Completion Procedures. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana May Latch, Ron Sigal |
A Local Termination Property for Term Rewriting Systems. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Nachum Dershowitz (eds.) |
Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Steinbach |
Extensions and Comparison of Simplification Orderings. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß |
On Equational Theories, Unification and Decidability. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Craig C. Squier, Friedrich Otto |
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop |
Term Rewriting Systems with Priorities. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. O'Donnell |
Term-Rewriting Implementation of Equational Logic Programming. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Hélène Kirchner |
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Bachmair, Nachum Dershowitz |
Completion for Rewriting Modulo a Congruence. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Walton Purdom Jr. |
Detecting Looping Simplifications. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
Knuth-Bendix, Matching, Unification, Simplification, Looping, Rewrite rules |
| 1 | R. Ramesh 0001, I. V. Ramakrishnan |
Optimal Speedups for Parallel Pattern Matching in Trees. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine Choppy, Stéphane Kaplan, Michèle Soria |
Algorithmic Complexity of Term Rewriting Systems. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Kaplan |
A Compiler for Conditional Term Rewriting Systems. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean H. Gallier, Wayne Snyder |
A General Complete E-Unification Procedure. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Annie Despland, Monique Mazaud, Raymond Rakotozafy |
Code Generator Generation Based on Template-Driven Target Term Rewriting. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Padawitz |
Strategy-Controlled Reduction and Narrowing. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhenyu Qian |
Structured Contextual Rewriting. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Some Results about Confluence on a Given Congruence Class. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Éric Sopena |
Combinatorial Hypermap Rewriting. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Lescanne (eds.) |
Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Réty |
Improving Basic Narrowing Techniques. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Madlener, Friedrich Otto |
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Benois |
Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Göbel |
Ground Confluence. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ursula Martin |
How to Choose Weights in the Knuth Bendix Ordering. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Strandh |
Optimizing Equational Programs. |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Dauchet, Francesco De Comité |
A Gap Between Linear and Non Linear Term-Rewriting Systems (1). |
RTA |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Benanav, Deepak Kapur, Paliath Narendran |
Complexity of Matching Problems. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
Associative-Commutative, NP-Completeness, Matching, Associative, Commutative |
| 1 | Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran |
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
Unification Problem, Finitely Presented Algebras, Commutative Algebras, Gröbner Basis, Knuth-Bendix Completion Procedure, Term Rewriting, Word Problem, Polynomial Ideals |
| 1 | Friedrich Otto |
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Albrecht Fortenbacher |
An Algebraic Approch to Unification Under Assoiativity and Commutativity. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine Choppy, Colette Johnen |
PETRIREVE: Proving Petri Net Properties with Rewriting Systems. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Pierre Jouannaud (eds.) |
Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Nachum Dershowitz |
Termination. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Erik Tidén |
Unification Problems with One-Sided Distributivity. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Buchberger |
Basic Features and Development of the Critical-Pair/Completion Procedure. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Hantao Zhang 0001, Jean-Luc Rémy |
Contextual Rewriting. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book |
Thue Systems as Rewriting Systems. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Bachmair, David A. Plaisted |
Associative Path Orderings. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Michaël Rusinowitch |
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Fribourg |
Handling Function Definitions through Innermost Superposition and Rewriting. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Katherine A. Yelick |
Combining Unification Algorithms for Confined Regular Equational Theories. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros S. Cosmadakis, Paris C. Kanellakis |
Two Applications of Equational Theories to Database Theory. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Zaionc |
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne |
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Hassan Aït-Kaci |
Solving Type Equations by Graph Rewriting. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Porat, Nissim Francez |
Fairness in Term Rewriting Systems. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Walton Purdom Jr., Cynthia A. Brown |
Fast Many-to-One Matching Algorithms. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Jieh Hsiang |
Two Results in Term Rewriting Theorem Proving. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | David Detlefs, Randy Forgaard |
A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil D. Jones, Peter Sestoft, Harald Søndergaard |
An Experiment in Partial Evaluation: The Generation of a Compiler Generator. |
RTA |
1985 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license