A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees

Authors:
Evgeny Dantsin;Andrei Voronkov
Affiliations:
-;-
Venue:
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Year:
1999

Citing 33
Cited 5

NP-completeness of the set unification and matching problems

Proc. of the 8th international conference on Automated deduction
An algebraic approach to unification under associativity and commutativity

Journal of Symbolic Computation
Associative-commutative unification

Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Unification in commutative idempotent monoids

Theoretical Computer Science
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Adventures in associative-commutative unification

Journal of Symbolic Computation
Logic programming with sets

Journal of Computer and System Sciences
A rule-based language with functions and sets

ACM Transactions on Database Systems (TODS)
On the power of rule-based languages with sets

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Set constructors in a logic database language

Journal of Logic Programming
Logic programming

Handbook of theoretical computer science (vol. B)
Compilation of set terms in the logic data language (LDL)

Journal of Logic Programming
A logic programming view of CLP

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Complexity of unification problems with associative-commutative operators

Journal of Automated Reasoning
A logical query language for hypermedia systems

Information Sciences—Informatics and Computer Science: An International Journal
Combining unification algorithms

Journal of Symbolic Computation
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable query languages for complex object databases

Journal of Computer and System Sciences
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
Complexity of nonrecursive logic programs with complex values

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of languages for the manipulation of complex values

The VLDB Journal — The International Journal on Very Large Data Bases
COL: A Logic-Based Language for Complex Objects

EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Logic Programming with Bounded Quantifiers

Proceedings of the First Russian Conference on Logic Programming
Complexity of Query Answering in Logic Databases with Complex Values

LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Set Constraints: Results, Applications, and Future Directions

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
AC-Complete Unification and its Application to Theorem Proving

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
A CLP View of Logic Programming

Proceedings of the Third International Conference on Algebraic and Logic Programming
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Tarskian Set Constraints

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

Complexity and Algorithms for the Matching of Bag and Set Terms

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Multiset Constraints and P Systems

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Building Theorem Provers

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The RuleML family of web rule languages

PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
An analysis of permutations in arrays

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unification in logic programming deals with tree-like data represented by terms. Some applications, including deductive databases, require handling more complex values, for example finite sets or bags (finite multisets). We extend unification to the combined domain of bags, sets and trees in which bags and sets are generated by constructors similar to the list constructor. Our unification algorithm is presented as a nondeterministic polynomial-time algorithm that solves equality constraints in the spirit of the Martelli and Montanari algorithm.