Title: Rewriting Techniques and Applications
Description: Rewriting Techniques and Applications: 10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings<br />Author: Paliath Narendran, Michael Rusinowitch<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-66201-3<br /> DOI: 10.1007/3-540-48685-2<br /><br />Table of Contents:<p></p><ul><li>Solved Forms for Path Ordering Constraints
</li><li>Jeopardy
</li><li>Strategic Pattern Matching
</li><li>On the Strong Normalization of Natural Deduction with Permutation-Conversions
</li><li>Normalisation in Weakly Orthogonal Rewriting
</li><li>Strong Normalization of Proof Nets Modulo Structural Congruences
</li><li>Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas
</li><li>Undecidability of the 
</li><li>Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting
</li><li>A New Result about the Decidability of the Existential One-Step Rewriting Theory
</li><li>A Fully Syntactic AC-RPO
</li><li>Theory Path Orderings
</li><li>A Characterisation of Multiply Recursive Functions with Higman’s Lemma
</li><li>Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
</li><li>Normalization via Rewrite Closures
</li><li>Test Sets for the Universal and Existential Closure of Regular Tree Languages
</li><li>Higher-Order Rewriting
</li><li>The Maude System
</li><li>TOY: A Multiparadigm Declarative System
</li><li>UniMoK: A System for Combining Equational Unification Algorithms</li></ul>
Subjects: Computer programming, Rewriting systems (Computer science), Algorithms, Congresses, Computer science, Logic design, Algebra, Data processing, Artificial intelligence