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

RPO constraint solving is in NP

Paliath Narendran 1 Michaël Rusinowitch Rakesh Verma
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Résumé : Nous montrons que la résolution des contraintes d'ordre RPO sur les termes est dans NP
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:01:16 PM
Last modification on : Friday, February 4, 2022 - 3:30:31 AM


  • HAL Id : inria-00098426, version 1



Paliath Narendran, Michaël Rusinowitch, Rakesh Verma. RPO constraint solving is in NP. Computer Science Logic, 1998, Brno, Tchêquie, 12 p. ⟨inria-00098426⟩



Record views