Unification Modulo ACUI Plus Distributivity Axioms

Siva Anantharaman 1 Paliath Narendran Michaël Rusinowitch 2
2 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 : E-unification problems are central in automated deduction. In this work, we consider unification modulo theories that extend the well-known ACI or ACUI by adding a binary symbol `*' that distributes over the AC(U)I-symbol `+'. If this distributivity is one-sided (say, to the left), we get the theory denoted AC(U)IDl; we show that AC(U)IDl-unification is DEXPTIME-complete. If `*' is assumed $2$-sided distributive over `+', we get the theory denoted AC(U)ID; we show unification modulo AC(U)ID to be NEXPTIME-decidable and DEXPTIME-hard. Both AC(U)IDl and AC(U)ID seem to be of practical interest, e.g. in the analysis of programs modeled in terms of process algebras. Our results, for the two theories considered, are obtained via two entirely different lines of reasoning. It is a consequence of our methods of proof, that modulo the theory which adds on to AC(U)ID the assumption that `*' is associative-commutative -- or just associative --, unification is undecidable.
Type de document :
Article dans une revue
Journal of Automated Reasoning, Springer Verlag, 2004, 33 (1), pp.1-28
Liste complète des métadonnées

Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:14
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10


  • HAL Id : inria-00099990, version 1


Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. Unification Modulo ACUI Plus Distributivity Axioms. Journal of Automated Reasoning, Springer Verlag, 2004, 33 (1), pp.1-28. 〈inria-00099990〉



Consultations de la notice