ACID-Unification is NEXPTIME-Decidable - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

ACID-Unification is NEXPTIME-Decidable

Résumé

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.
Fichier non déposé

Dates et versions

hal-00080663 , version 1 (20-06-2006)

Identifiants

  • HAL Id : hal-00080663 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More