Rewriting Techniques and Applications: 14th International Conference, RTA 2003 Valencia, Spain, June 9–11, 2003 Proceedings
Author: Robert Nieuwenhuis
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40254-1
DOI: 10.1007/3-540-44881-0

Table of Contents:

Symbolic Systems Biology
Confluence as a Cut Elimination Property
Associative-Commutative Rewriting on Large Terms
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms
Efficient Reductions with Director Strings
Rewriting Logic and Probabilities
The Maude 2.0 System
Diagrams for Meaning Preservation
Expression Reduction Systems with Patterns
Residuals in Higher-Order Rewriting
Rewriting UNITY
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties
Rule-Based Analysis of Dimensional Safety
Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems
On the Complexity of Higher-Order Matching in the Linear λ-Calculus
XML Schema, Tree Logic and Sheaves Automata
Size-Change Termination for Term Rewriting
Monotonic AC-Compatible Semantic Path Orderings