UNIFICATION MODULO ACI + 1 + 0

Authors:
Paliath Narendran
Affiliations:
Institute of Programming and Logics. Department of Computer Science. State University of New York at Albany, Albany, NY 12222
Venue:
Fundamenta Informaticae
Year:
1996

Citing 14
Cited 0

NP-completeness of the set unification and matching problems

Proc. of the 8th international conference on Automated deduction
Associative-commutative unification

Journal of Symbolic Computation
Complexity of matching problems

Journal of Symbolic Computation
Unification theory

Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability

Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Complexity of unification problems with associative-commutative operators

Journal of Automated Reasoning
Unification theory

Handbook of logic in artificial intelligence and logic programming
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Combination Techniques and Decision Problems for Disunification

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that elementary ACI10 unification is in P, even with constant restrictions. As a corollary, we prove that validity of quantified Horn formulae can be tested in O(n 2) time. Solvability of elementary disunification problems modulo ACI10 is shown to be NP-hard.