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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00098607
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 5:03:56 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM

Identifiers

  • HAL Id : inria-00098607, version 1

Collections

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⟩

Share

Metrics

Record views

83