Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2019

Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations

Résumé

Decision procedures for various list theories have been investigated in the literature with applications to automated verification. Here we show that the unifiability problem for some list theories with a reverse operator is NP-complete. We also give a unifiability algorithm for the case where the theories are extended with a length operator on lists.

Domaines

Informatique et langage [cs.CL]
Fichier principal
Vignette du fichier
Research-Report2019.pdf (199.35 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Siva Anantharaman  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-02123648

Soumis le : mercredi 8 mai 2019-18:01:20

Dernière modification le : lundi 11 septembre 2023-17:41:19

Télécharger pour visualiser

Dates et versions

hal-02123648 , version 1 (08-05-2019)
hal-02123648 , version 2 (01-08-2019)

Identifiants

  • HAL Id : hal-02123648 , version 1

Citer

Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michael Rusinowitch. Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations. 2019. ⟨hal-02123648v1⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

MSL MSL-THESE
162 Consultations
287 Téléchargements

Partager

More