5. RTA 1993:
Montreal,
Canada
Claude Kirchner (Ed.):
Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings.
Lecture Notes in Computer Science 690 Springer 1993, ISBN 3-540-56868-9 BibTeX
@proceedings{DBLP:conf/rta/1993,
editor = {Claude Kirchner},
title = {Rewriting Techniques and Applications, 5th International Conference,
RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings},
booktitle = {RTA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {690},
year = {1993},
isbn = {3-540-56868-9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Leo Bachmair:
Rewrite Techniques in Theorem Proving (Abstract).
1 BibTeX
- Christopher Lynch, Wayne Snyder:
Redundancy Criteria for Constrained Completion.
2-16 BibTeX
- Jordi Levy, Jaume Agustí-Cullell:
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations.
17-31 BibTeX
- Hantao Zhang:
A Case Study of Completion Modulo Distributivity and Abelian Groups.
32-46 BibTeX
- Andreas Werner:
A Semantic Approach to Order-Sorted Rewriting.
47-61 BibTeX
- Jürgen Avenhaus, Jörg Denzinger:
Distributing Equational Theorem Proving.
62-76 BibTeX
- Soumen Chakrabarti, Katherine A. Yelick:
On the Correctness of a Distributed Memory Gröbner basis Algorithm.
77-91 BibTeX
- Max Moser:
Improving Transformation Systems for General E-Unification.
92-105 BibTeX
- Joachim Niehren, Andreas Podelski, Ralf Treinen:
Equational and Membership Constraints for Finite Trees.
106-120 BibTeX
- Rolf Backofen:
Regular Path Expression in Feature Logic.
121-135 BibTeX
- Jean H. Gallier:
Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract).
136 BibTeX
- Daniel J. Dougherty:
Some Lambda Calculi with Categorial Sums and Products.
137-151 BibTeX
- Andrea Asperti, Cosimo Laneve:
Paths, Computations and Labels in the Lambda-Calculus.
152-167 BibTeX
- Femke van Raamsdonk:
Confluence and Superdevelopments.
168-182 BibTeX
- Zena M. Ariola:
Relating Graph and Term Rewriting via Böhm Models.
183-197 BibTeX
- Nachum Dershowitz, Charles Hoot:
Topics in Termination.
198-212 BibTeX
- Maria C. F. Ferreira, Hans Zantema:
Total Termination of Term Rewriting.
213-227 BibTeX
- Aart Middeldorp, Bernhard Gramlich:
Simple Termination is Difficult.
228-242 BibTeX
- Zurab Khasidashvili:
Optimal Normalization in Orthogonal Term Rewriting Systems.
243-258 BibTeX
- John Field:
A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report).
259-273 BibTeX
- Ernst Lippe:
Generating Tables for Bottom-Up Matching.
274-288 BibTeX
- Sergei I. Adian:
On some Algorithmic Problems for Groups and Monoids.
289-300 BibTeX
- Franz Baader, Klaus U. Schulz:
Combination Techniques and Decision Problems for Disunification.
301-315 BibTeX
- Mohamed Tajine:
The Negation Elimination from Syntactic Equational Formula is Decidable.
316-327 BibTeX
- Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet:
Encompassment Properties and Automata with Constraints.
328-342 BibTeX
- Jean-Claude Raoult:
Recursively Defined Tree Transductions.
343-357 BibTeX
- Maribel Fernández:
AC Complement Problems: Satisfiability and Negation Elimination.
358-373 BibTeX
- Albert Rubio, Robert Nieuwenhuis:
A Precedence-Based Total AC-Compatible Ordering.
374-388 BibTeX
- Catherine Delor, Laurence Puel:
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols.
389-404 BibTeX
- David A. Plaisted:
Polynomial Time Termination and Constraint Satisfaction Tests.
405-420 BibTeX
- Ursula Martin:
Linear Interpretations by Counting Patterns.
421-433 BibTeX
- Géraud Sénizergues:
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).
434 BibTeX
System Description
Open Problems
Copyright © Sat May 16 23:36:09 2009
by Michael Ley (ley@uni-trier.de)
