Unification problems with one-sided distributivity
Journal of Symbolic Computation
Unification in commutative theories
Journal of Symbolic Computation
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
Journal of Symbolic Computation
A decision algorithm for distributive unification
Theoretical Computer Science - Special issue on rewriting techniques and applications
Unification of concept terms in description logics
Journal of Symbolic Computation
Generalized Definite Set Constraints
Constraints
Solving Systems of Set Constraints using Tree Automata
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Set Constraints
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Unification in Monoidal Theories
Proceedings of the 10th International Conference on Automated Deduction
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Solving linear equations over polynomial semirings
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Set constraints with intersection
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Analysis and Automatic Detection of Information Flows in Systems and Networks (PhD Thesis)
Analysis and Automatic Detection of Information Flows in Systems and Networks (PhD Thesis)
Computation: finite and infinite machines
Computation: finite and infinite machines
Closure properties and decision problems of dag automata
Information Processing Letters
Closure properties and decision problems of dag automata
Information Processing Letters
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
An error-tolerant type system for variational lambda calculus
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Extending Type Inference to Variational Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
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 two-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, for example, in the analysis of programs modeled in terms of process algebras. Our results, for the two theories considered, are obtained through two entirely different lines of reasoning. A consequence of our methods of proof is that, modulo the theory that adds to AC(U)ID the assumption that "*" is associative-commutative, or just associative, unification is undecidable.