ACID-Unification is NEXPTIME-Decidable

Siva Anantharaman Paliath Narendran 1, 2 Michaël Rusinowitch 1, 3
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We consider the unification problem for the equational theory AC(U)ID obtained by adjoining a binary `*' which is distributive over an associative-commutative idempotent operator `+', possibly admitting a unit element U. We formulate the problem as a particular class of set constraints, and propose a method for solving it by using the dag automata introduced by W. Charatonik, that we enrich with labels for our purposes. AC(U)ID-unification is thus shown to be in NEXPTIME.
Document type :
Conference papers
Complete list of metadatas
Contributor : Siva Anantharaman <>
Submitted on : Tuesday, June 20, 2006 - 8:44:38 AM
Last modification on : Tuesday, August 13, 2019 - 11:32:01 AM


  • HAL Id : hal-00080663, version 1


Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. ACID-Unification is NEXPTIME-Decidable. 2003, pp.169--178. ⟨hal-00080663⟩



Record views