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

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

Identifiers

  • HAL Id : inria-00098426, version 1

Collections

Citation

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

Share

Metrics

Record views

118