Rewriting techniques and applications : 9th international conference, RTA-98, Tsukuba, Japan, March 28-April 1, 1998 : proceedings
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...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
1379 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Rewriting techniques and applications, 9th international conference, RTA-98, Tsukuba, Japan, March 28-April 1, 1998, proceedings, Tobias Nipkow (ed.), 1998, Berlin, Springer, 1 vol. (X-342 p.), Lecture notes in computer science, 3-540-64301-X • Rewriting Techniques and Applications, Texte imprimé, 9783662193471 |
Taula de continguts:
- 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.