A uniform approach to constraint-solving for lists, multisets, compact lists, and sets

ACM Transactions on Computational Logic

Volumn 9, Issue 3, 2008, Pages

  Dovier, Agostino ^a   Piazza, Carla ^a   Rossi, Gianfranco ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF PARMA   (Italy)

Author keywords

Compact lists; Lists; Membership and equality constraints; Multisets; Sets

Indexed keywords

ALUMINUM; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; FILE ORGANIZATION; SET THEORY; TECHNOLOGY; TRANSIENTS;

CONSTRAINT SOLVING; GENERAL (CO); MULTI-SETS; PARAMETRIC APPROACH; UNIFICATION ALGORITHMS;

DATA STRUCTURES;

EID: 45749144766     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1352582.1352583     Document Type: Article

References (36)

1. ALIFFI, D., DOVIER, A., AND ROSSI, G. 1999. From set to hyperset unification. J. Funct. Logic Program. 10, 1-48.
2. BAADER, F. AND BÜTTNER, W. 1988. Unification in commutative and idempotent monoids. Theoret. Comput. Sci. 56, 345-352.
3. BAADER, F. and NIPKOW, T. 1998. Term Rewriting and All That. Cambridge University Press, Cambridge, U.K.
4. BAADER, F. AND SCHULZ, K. U. 1995. Combination techniques and decision problems for disunification. Theoret. Comput. Sci. 142, 229-255.
5. BAADER, F. AND SCHULZ, K. U. 1996. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbol. Computat. 21, 211-243.
6. BANATRE, J. AND MÉTAYER, D. L. 1993. Programming by multiset transformation. Commun. ACM 36, 1, 98-111.
7. BEERI, C., NAQVI, S., SHMUELI, O., AND TSUR, S. 1991. Set constructors in a logic database language. J. Logic Program. 10, 3, 181-232.
8. BÜCKERT, H. 1988. Solving disequations in equational theories. In Proceedings of the International Conference on Automated Deduction, E. L. Lusk and R. A. Overbeek, Eds. Lecture Notes in Computer Science, vol. 310. Springer, Argonne, IL, 517-526.
9. BÜTTNER, W. 1986. Unification in the data structure Sets. In Proceedings of the International Conference on Automated Deduction, J. K. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer, Oxford, U.K., 470-488.
10. CANTONE, D., OMODEO, E. G., AND POLICRITI, A. 2001. Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer, New York, NY.
11. CHANG, C. C. AND KEISLER, H. J. 1973. Model Theory. Studies in Logic. North Holland, Amsterdam, The Netherlands.
12. CLARK, K. L. 1978. Negation as Failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, 293-321.
13. COMON, H. 1993. Complete Axiomatixations of some quotient term algebras. Theoret. Comput. Sci. 118, 2, 167-191.
14. CORBIN, J. AND BIDOIT, M. 1983. A rehabilitation of Robinson's unification algorithm. In Information Processing, IFIP 9th World Computer Congress, R. Mason, Ed. North Holland, Paris, France, 909-914.
15. DANTSIN, E. AND VORONKOV, A. 1999. A nondeterministic polynomial-time unification algorithm for bags, sets and trees. In Foundations of Software Science and Computation Structure, W. Thomas, Ed. Lecture Notes in Computer Science, vol. 1578. Springer, Amsterdam, The Netherlands, 180-196.
16. DERSHOWITZ, N. AND MANNA, Z. 1979. Proving termination with multiset ordering. Commun. ACM 22, 8, 465-476.
17. DOVIER, A., OMODEO, E. G., PONTELLI, E., AND ROSSI, G. 1996. {log}: A Language for Programming in Logic with Finite Sets. J. Logic Program. 28, 1, 1-44.
18. DOVIER, A., PIAZZA, C., AND POLICRITI, A. 2000a. Comparing expressiveness of set constructor symbols. In Frontiers of Combining Systems, H. Kirchner and C. Ringeissen, Eds. Lecture Notes in Computer Science, vol. 1794. Springer, Nancy, France, 275-289.
19. DOVIER, A., PIAZZA, C., AND PONTELLI, E. 2004. Disunification in ACI1 theories. Constraints (Inter-nat. J.) 9, 1, 35-91.
20. DOVIER, A., PIAZZA, C., PONTELLI, E., AND ROSSI, G. 2000b. Sets and constraint logic programming. ACM Trans. Program. Lang. Syst. 22, 5, 861-931.
21. DOVIER, A., PIAZZA, C., AND ROSSI, G. 2003. A uniform approach to constraint-solving for lists, multisets, compact lists, and sets. CoRR cs.PL/030945.
22. DOVIER, A., POLICRITI, A., AND ROSSI, G. 1998. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundamenta Informaticae 36, 2/3, 201-234.
23. DOVIER, A., PONTELLI, E., AND ROSSI, G. 2001. Set unification. CoRR cs.LO/0110023. To appear in Theory and Practice of Logic Programming.
24. DOVIER, A. AND ROSSI, G. 1993. Embedding Extensional Finite Sets in CLP. In International Logic Programming Symposium, D. Miller, Ed. MIT Press, Cambridge, MA, 540-556.
25. ENDERTON, H. B. 1973. A Mathematical Introduction to Logic, 2nd ed. Academic Press, New York, NY.
26. GERVET, C. 1997. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints (Int. J.) 1, 191-246.
27. GRUMBACH, S. AND MILO, T. 1996. Towards tractable algebras for bags. J. Comput. Syst. Sci. 52, 3, 570-588.
28. HILL, P. M. AND LLOYD, J. W. 1994. The Gödel Programming Language. MIT Press, Cambridge, MA.
29. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. J. Logic Program. 19-20, 503-581.
30. LIVESEY, M. AND SIEKMANN, J. 1976. Unification of sets and multisets. Tech. rep. Institüt für Informatik I, Universität Karlsruhe, Karlsruhe, Germany.
31. MAL'CEV, A. 1971. Axiomatizable classes of locally free algebras of various types. In The Meta-mathematics of Algebraic Systems. North Holland, Amsterdam, The Netherlands, Chapter 23, 262-281.
32. PĀUN, G. 2000. Computing with membranes. J. Comput. Syst. Sci. 61, 1, 108-143.
33. POTTER, B., SINCLAIR, J., AND TZILL, D. 1996. An Introduction to Formal Specification and Z, 2nd ed. Prentice Hall, Upper Saddle River, NJ.
34. SCHWARTZ, J.T., DEWAR, R. B. K., AND SCHONBERG, E. 1986. Programming with Sets: An Introduction to SETL. Springer, Berlin, Germany.
35. SIEKMANN, J. H. 1989. Unification theory: A survey. J. Symbol. Computat. (Special issue on unification) 7, 3,4, 207-274.
36. TZOUVARAS, A. 1998. The linear logic of multisets. Logic J. IGPL 6, 6, 901-916.