4. RTA 1991:
Como,
Italy
Ronald V. Book (Ed.):
Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings.
Lecture Notes in Computer Science 488 Springer 1991, ISBN 3-540-53904-2 BibTeX
@proceedings{DBLP:conf/rta/1991,
editor = {Ronald V. Book},
title = {Rewriting Techniques and Applications, 4th International Conference,
RTA-91, Como, Italy, April 10-12, 1991, Proceedings},
booktitle = {RTA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {488},
year = {1991},
isbn = {3-540-53904-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).
1-12 BibTeX
- William M. Farmer, Ronald J. Watro:
Redex Capturing in Term Graph Rewriting (Concise Version).
13-24 BibTeX
- David A. Wolfram:
Rewriting, and Equational Unification: the Higher-Order Cases.
25-36 BibTeX
- Daniel J. Dougherty:
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract).
37-48 BibTeX
- Frank Drewes, Clemens Lautemann:
Incremental Termination Proofs and the Length of Derivations.
49-61 BibTeX
- Dieter Hofbauer:
Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.
62-73 BibTeX
- Stefan Krischer, Alexander Bockmayr:
Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test.
74-85 BibTeX
- Franz Baader:
Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems.
86-97 BibTeX
- Eric Domenjoud:
AC Unification Through Order-Sorted AC1 Unification.
98-111 BibTeX
- Jacques Chabin, Pierre Réty:
Narrowing Directed by a Graph of Terms.
112-123 BibTeX
- Franz Baader, Werner Nutt:
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification.
124-135 BibTeX
- Francis Klay:
Undecidable Properties of Syntactic Theories.
136-149 BibTeX
- Wayne Snyder, Christopher Lynch:
Goal Directed Strategies for Paramodulation.
150-161 BibTeX
- Loic Pottier:
Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms.
162-173 BibTeX
- Hélène Kirchner:
Proofs in Parameterized Specification.
174-187 BibTeX
- Aart Middeldorp, Yoshihito Toyama:
Completeness of Combinations of Constructor Systems.
188-199 BibTeX
- Tobias Nipkow, Zhenyu Qian:
Modular Higher-Order E-Unification.
200-214 BibTeX
- Pierre-Louis Curien, Giorgio Ghelli:
On Confluence for Weakly Normalizing Systems.
215-225 BibTeX
- Françoise Bellegarde:
Program Transformation and Rewriting.
226-239 BibTeX
- Dave Cohen, Phil Watson:
An Efficient Representation of Arithmetic for Term Rewriting.
240-251 BibTeX
- Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan:
Query Optimization Using Rewrite Rules.
252-263 BibTeX
- Rolf Socher-Ambrosius:
Boolean Algebra Admits No Convergent Term Rewriting System.
264-274 BibTeX
- Kai Salomaa:
Decidability of Confluence and Termination of Monadic Term Rewriting Systems.
275-286 BibTeX
- Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata and Rewrite Systems.
287-298 BibTeX
- Gregory Kucherov:
On Relationship Between Term Rewriting Systems and Regular Tree Languages.
299-311 BibTeX
- Franz-Josef Brandenburg:
The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree.
312-322 BibTeX
- Albert Gräf:
Left-to-Right Tree Pattern Matching.
323-334 BibTeX
- R. Ramesh, I. V. Ramakrishnan:
Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems.
335-347 BibTeX
- Maria Paola Bonacina, Jieh Hsiang:
On Fairness of Completion-Based Theorem Proving Strategies.
348-360 BibTeX
- Jürgen Avenhaus:
Proving Equational and Inductive Theorems by Completion and Embedding Techniques.
361-373 BibTeX
- Andrea Sattler-Klein:
Divergence Phenomena during Completion.
374-385 BibTeX
- Reinhard Bündgen:
Simulation Buchberger's Algorithm by Knuth-Bendix Completion.
386-397 BibTeX
- Miki Hermann:
On Proving Properties of Completion Strategies.
398-410 BibTeX
- Claude Marché:
On Ground AC-Completion.
411-422 BibTeX
- Paliath Narendran, Michaël Rusinowitch:
Any Gound Associative-Commutative Theory Has a Finite Canonical System.
423-434 BibTeX
- Ulrich Fraus:
A Narrowing-Based Theorem Prover.
435-436 BibTeX
- Michel Billaud:
ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities.
437-438 BibTeX
- Aline Deruyver:
EMMY: A Refutational Theorem Prover for First-Order Logic with Equation.
439-441 BibTeX
- Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie:
The Tecton Proof System.
442-444 BibTeX
- Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Open Problems in Rewriting.
445-456 BibTeX
Copyright © Sat May 16 23:36:09 2009
by Michael Ley (ley@uni-trier.de)
