Inferring RPO Symbol Ordering - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Inferring RPO Symbol Ordering

Résumé

We study the recursive path ordering (RPO) in the context of string-rewriting systems. We are interested in finding a symbol ordering in RPO such that for every rule in the rewriting system, the left hand side is higher than the right hand side. We show that this SYMBOL-ORDER problem is NP-complete by a reduction from the 2-3-SAT problem. We also work on the one-rule case and show a polynomial time algorithm for such systems.
Fichier principal
Vignette du fichier
UNIF_2023_paper_7.pdf (134.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04128213 , version 1 (14-06-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04128213 , version 1

Citer

Wei Du, Paliath Narendran, Michael Rusinowitch. Inferring RPO Symbol Ordering. UNIF 2023 - 37th International Workshop on Unification, Veena Ravishankar; Christophe Ringeissen, Jul 2023, Rome, Italy. ⟨hal-04128213⟩
43 Consultations
14 Téléchargements

Partager

Gmail Facebook X LinkedIn More