Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
Handbook of theoretical computer science (vol. B)
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
On the representation and management of finite sets in CLP languages
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
The first-order theories of lists, multisets, compact lists (i.e., lists where the number of contiguous occurrences of each element is immaterial), and sets are introduced via axioms. Such axiomatizations are shown to be very well-suited for the integration with free functor symbols governed by the classical Clark's axioms in the context of (Constraint) Logic Programming. Adaptations of the extensionality principle to the various theories taken into account is then exploited in the design of unification algorithms for the considered data structures. All the theories presented can be combined providing frameworks to deal with several of the proposed data structures simultaneously. The unification algorithms proposed can be combined (merged) as well, to produce engines for such combination theories.