Unification Modulo ACUI Plus Distributivity Axioms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2004

Unification Modulo ACUI Plus Distributivity Axioms


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.

Dates and versions

inria-00099990 , version 1 (26-09-2006)



Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. Unification Modulo ACUI Plus Distributivity Axioms. Journal of Automated Reasoning, 2004, 33, pp.1-28. ⟨10.1007/s10817-004-2279-7⟩. ⟨inria-00099990⟩
152 View
0 Download



Gmail Facebook Twitter LinkedIn More