Rewriting Techniques and Applications

By Robert Nieuwenhuis

Subjects: Congresses, Computer programming, Rewriting systems (Computer science), Algorithms

Description: Rewriting Techniques and Applications: 14th International Conference, RTA 2003 Valencia, Spain, June 9–11, 2003 Proceedings<br />Author: Robert Nieuwenhuis<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-40254-1<br /> DOI: 10.1007/3-540-44881-0<br /><br />Table of Contents:<p></p><ul><li>Symbolic Systems Biology </li><li>Confluence as a Cut Elimination Property </li><li>Associative-Commutative Rewriting on Large Terms </li><li>A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms </li><li>Efficient Reductions with Director Strings </li><li>Rewriting Logic and Probabilities </li><li>The Maude 2.0 System </li><li>Diagrams for Meaning Preservation </li><li>Expression Reduction Systems with Patterns </li><li>Residuals in Higher-Order Rewriting </li><li>Rewriting UNITY </li><li>New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols </li><li>An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation </li><li>Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties </li><li>Rule-Based Analysis of Dimensional Safety </li><li>Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems </li><li>On the Complexity of Higher-Order Matching in the Linear λ-Calculus </li><li>XML Schema, Tree Logic and Sheaves Automata </li><li>Size-Change Termination for Term Rewriting </li><li>Monotonic AC-Compatible Semantic Path Orderings</li></ul>