Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
Unification in the data structure sets
Proc. of the 8th international conference on Automated deduction
Unification in commutative idempotent monoids
Theoretical Computer Science
Journal of Symbolic Computation
Set constructors in a logic database language
Journal of Logic Programming
Programming by multiset transformation
Communications of the ACM
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
The Go¨del programming language
The Go¨del programming language
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Combination techniques and decision problems for disunification
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Towards tractable algebras for bags
Journal of Computer and System Sciences
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Term rewriting and all that
A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
Fundamenta Informaticae
Journal of Computer and System Sciences
Proving termination with multiset orderings
Communications of the ACM
Sets and constraint logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Set theory for computing: from decision procedures to declarative programming with sets
Set theory for computing: from decision procedures to declarative programming with sets
An Introduction to Formal Specification and Z
An Introduction to Formal Specification and Z
Comparing Expressiveness of Set Constructor Symbols
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Solving Disequations in Equational Theories
Proceedings of the 9th International Conference on Automated Deduction
Disunification in ACI1 Theories
Constraints
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Programming with partially specified aggregates in Java
Computer Languages, Systems and Structures
An analysis of permutations in arrays
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of computer science. They have been analyzed from an axiomatic point of view with a parametric approach in Dovier et al. [1998], where the relevant unification algorithms have been developed. In this article, we extend these results considering more general constraints, namely, equality and membership constraints and their negative counterparts.