HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Algorithms and Reductions for Rewriting Problems

Rakesh Verma 1 Michaël Rusinowitch Denis Lugiez
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Résumé : Nous étudions les réductions polynomiales entre des problèmes réécriture. Nous montrons que la confluence des semi-Thue commutatifsest décidable.
Mots-clés : réécriture confluences rewriting polynomial reductions réduction polynomiales de problemes confluence
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00098607
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:03:56 PM
Last modification on : Friday, February 4, 2022 - 3:31:23 AM

Identifiers

  • HAL Id : inria-00098607, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | INRIA2

Citation

Rakesh Verma, Michaël Rusinowitch, Denis Lugiez. Algorithms and Reductions for Rewriting Problems. Proceedings 9th Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan, pp.166-180. ⟨inria-00098607⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

47

 

Contact                    Legal Notice                    Personal Data