Unification modulo Lists with Reverse, Relation with Certain Word Equations

Abstract : 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 \emph{reverse} operator is NP-complete. We also give a unifiability algorithm for the case where the theories are extended with a \emph{length} operator on lists.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02123709
Contributor : Siva Anantharaman <>
Submitted on : Wednesday, May 8, 2019 - 10:07:18 PM
Last modification on : Tuesday, July 16, 2019 - 4:05:22 PM

Identifiers

Données associées

Citation

Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch. Unification modulo Lists with Reverse, Relation with Certain Word Equations. CADE-27 - The 27th International Conference on Automated Deduction, Association for Automated Reasoning (AAR), Aug 2019, Natal, Brazil. pp 7--23, ⟨10.1007/978-3-030-29436-6⟩. ⟨hal-02123709⟩

Share

Metrics

Record views

52