# On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups

@inproceedings{Hermann1997OnTC,
title={On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups},
author={Miki Hermann and Phokion G. Kolaitis},
booktitle={CP},
year={1997}
}
• Published in CP 29 October 1997
• Mathematics, Computer Science
We analyze the computational complexity of elementary unification and disunification problems for the equational theory ACI of commutative idempotent semigroups. From earlier work, it was known that the decision problem for elementary ACI-unification is solvable in polynomial time. We show that this problem is inherently sequential by establishing that it is complete for polynomial time (P-complete) via logarithmic-space reductions. We also investigate the decision problem and the counting…
5 Citations
Under Consideration for Publication in Theory and Practice of Logic Programming Set Unification
• Computer Science
A uniform presentation of unification of sets, formalizing it at the level of set theory, and presenting a new goal-driven algorithm for general ACI 1 unification and a new simpler algorithms for general (Ab)(C ℓ) unification.
Set unification
• Computer Science
Theory and Practice of Logic Programming
• 2006
A uniform presentation of unification of sets, formalizing it at the level of set theory, and presenting a new goal-driven algorithm for general $ACI1$ unification and a new simpler algorithms for general $(Ab)(C\ell)$ unification.
Preserving Data Integrity in Distributed Systems
This thesis provides a technologyindependent framework for design-time analysis of distributed data-aware systems using algebraic Petri nets and shows that there exists a bound for the conditions of each step of a distributed system if and only if the steps can be described by a finite set of transitions of an algebraicPetri net.
A Bibliography of Papers in Lecture Notes in Computer Science ( 1999 ) , Part 2 of 2
(111)7x7 [501]. (k − 1) [1300]. 0/1 [237]. 012 [248]. 1 [1300]. 128 [1102]. 2 [1402, 1750, 1755, 493, 546, 1307, 910, 212, 239, 1113, 244, 1270, 873, 320, 874, 1602]. 2R [1782]. 3 [1620, 1537, 1291,
Unification Theory
• Computer Science, Mathematics
Handbook of Automated Reasoning
• 2001

## References

SHOWING 1-10 OF 22 REFERENCES
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)
• Mathematics
MFCS
• 1995
Using graph-theoretic techniques, it is shown that if each variable is restricted to having at most two occurrences, then several cases of simultaneous elementary AC- matching and ACU-matching can be solved in polynomial time.
On the Sequential Nature of Unification
• Computer Science, Mathematics
J. Log. Program.
• 1984
Unification in Commutative Idempotent Monoids
• Computer Science
Theor. Comput. Sci.
• 1988
NP-Completeness of the Set Unification and Matching Problems
• Mathematics
• 1986
The set-unification and set-matching problems, which are very restricted cases of the associative-commutative-idempotent unification and matching problems, respectively, are shown to be NP-complete.
Complete problems for deterministic polynomial time
• Mathematics, Computer Science
STOC '74
• 1974
Several problems which are complete for P, the class of languages recognizable in deterministic polynomial time, are introduced, to serve to differentiate those sets in P which are not recognizable in logarithmic space from those which are, providing such differentiation is possible.
Computers and Intractability: A Guide to the Theory of NP-Completeness
• Computer Science
• 1978
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
The Complexity of Counting Problems in Equational Matching
• Mathematics, Computer Science
J. Symb. Comput.
• 1995
A class of counting problems that arise naturally in equational matching and are studied to capture more accurately the computational difficulties associated with finding complete sets of minimal E-matchers than the corresponding decision problem for E-matching does.
Complexity of Matching Problems
• Mathematics
J. Symb. Comput.
• 1987