Rewriting Techniques and Applications 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Nipkow, Tobias (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1379
• Θέματα: Programming languages (Electronic computers).; Mathematical logic.; Computer logic.; Artificial intelligence.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Artificial Intelligence.; Mathematical Logic and Foundations.

This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with...

Πίνακας περιεχομένων:

• Origin tracking in term rewriting
• Simultaneous critical pairs and Church-Rosser property
• Church-Rosser theorems for abstract reduction modulo an equivalence relation
• Automatic monoids versus monoids with finite convergent presentations
• Decidable and undecidable second-order unification problems
• On the exponent of periodicity of minimal solutions of context equations
• Unification in extensions of shallow equational theories
• Unification and matching in process algebras
• E-unification for subsystems of S4
• Solving disequations modulo some class of rewrite systems
• About proofs by consistency
• Normalization of S-terms is decidable
• Decidable approximations of sets of descendants and sets of normal forms
• Algorithms and reductions for rewriting problems
• The decidability of simultaneous rigid E-unification with one variable
• Ordering constraints over feature trees expressed in second-order monadic logic
• Co-definite set constraints
• Modularity of termination using dependency pairs
• Termination of associative-commutative rewriting by dependency pairs
• Termination transformation by tree lifting ordering
• Towards automated termination proofs through "freezing"
• Higher-order rewriting and partial evaluation
• SN combinators and partial combinatory algebras
• Coupling saturation-based provers by exchanging positive/negative information
• An on-line problem database.