Sets and Constraint Logic Programming

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 5, 2000, Pages 861-931

  Dovier, Agostino ^a   Piazza, Carla ^b   Pontelli, Enrico ^c,e   Rossi, Gianfranco ^d  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

^c NEW MEXICO STATE UNIVERSITY   (United States)

^d UNIVERSITY OF PARMA   (Italy)

^e New Mexico State University   (United States)

Author keywords

D.3.2 Programming Languages : Constraint and Logic Languages; D.3.3 Programming Languages : Language Constructs and Features; F.4 Mathematical Logic and Formal Languages : Mathematical Logic Logic and Constraint Programming, Set Theory

Indexed keywords

EID: 0348203654     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/365151.365169     Document Type: Article

References (66)

1. ABITEBOUL, S. AND GRUMBACH., S. 1991. A Rule-Based Language with Functions and Sets. ACM Trans. on Database Systems 16, 1, 1-30.
2. ABRIAL, J.-R. 1996. The B-Book: Assigning Programs to Meanings. Cambridge University Press.
3. ACZEL, P. 1988. Non-well-founded Sets. Lecture Notes, Center for the Study of Language and Information, vol. 14. Stanford.
4. ALIFFI, D., DOVIER, A., AND ROSSI, G. 1999. From Set to Hyperset Unification. Journal of Functional and Logic Programming 1999, 10 (September).
5. APT, K. R. AND BOL, R. N. 1994. Logic Programming and Negation: A Survey. The Journal of Logic Programming 19 & 20, 9-72.
6. ARENAS-SÁNCHEZ, P. AND DOVIER, A. 1997. A Minimality Study for Set Unification. Journal of Functional and Logic Programming 1997, 7 (December).
7. BAADER, F. AND BÜTTNER, W. 1988. Unification in Commutative and Idempotent Monoids. Theoretical Computer Science 56, 345-352.
8. BAADER, F. AND SCHULZ, K. U. 1996. Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. Journal of Symbolic Computation 21, 211-243.
9. BANATRE, J. P. AND LEMETAYER, D. 1993. Programming by Multiset Transformation. Communications of the ACM 36, 1 (Jan.), 98-111.
10. BEERI, C., NAQVI, S., SHMUELI, O., AND TSUR., S. 1991. Set Constructors in a Logic Database Language. Journal of Logic Programming 10, 3, 181-232.
11. BÜTTNER, W. 1986. Unification in the Data Structure Sets. In Proc. of the Eight International Conference on Automated Deduction, J. K. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer-Verlag, Berlin, 470-488.
12. CANTONE, D., FERRO, A., AND OMODEO., E. G. 1989. Computable Set Theory, Vol. 1. Number 6 in International Series of Monographs on Computer Science. Clarendon Press, Oxford.
13. CARMONA, R., DOVIER, A., AND ROSSI, G. 1997. Dealing with Infinite Intensional Sets in CLP. In APPIA-GULP-PRODE'97. Joint Conf. on Declarative Programming, M. Falaschi, Ed. 467-477. Grado, Italy.
14. CASEAU, Y. AND LABURTHE, F. 1996. Introduction to the CLAIRE Programming Language. Technical report, LIENS.
15. CHAN, D. 1988. Constructive Negation Based on the Completed Database. In Proc. Fifth International Conference and Symposium on Logic Programming, R. Kowalski and K. Bowen, Eds. The MIT Press, Cambridge, Mass., 111-125.
16. CHANG, C. C. AND KEISLER, H. J. 1973. Model Theory. Studies in Logic. North Holland.
17. CLARK, K. L. 1978. Negation as Failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, 293-321.
18. COOKE, D. E. 1996. An Introduction to SequenceL: A Language to Experiment with Constructs for Processing Nonscalars. Software - Practice and Experience 26, 11 (Nov.), 1205-1246.
19. DERSHOWITZ, N. AND MANNA, Z. 1979. Proving Termination with Multiset Ordering. Communication of the ACM 22, 8, 465-476.
20. DOVIER, A. 1996. Computable Set Theory and Logic Programming. Ph.D. thesis, Università degli Studi di Pisa. TD-1/96.
21. DOVIER, A. AND ROSSI, G. 1993. Embedding Extensional Finite Sets in CLP. In Proc. of International Logic Programming Symposium, ILPS'93, D. Miller, Ed. The MIT Press, Cambridge, Mass., 540-556. Vancouver, BC, Canada.
22. DOVIER, A., OMODEO, E. G., PONTELLI, E., AND ROSSI., G. 1991. {log}: A Logic Programming Language with Finite Sets. In Proc. Eighth International Conf. on Logic Programming, K. Furukawa, Ed. The MIT Press, Cambridge, Mass., 111-124. Paris.
23. DOVIER, A., OMODEO, E. G., PONTELLI, E., AND ROSSI, G. 1996. {log}: A Language for Programming in Logic with Finite Sets. Journal of Logic Programming 28, 1, 1-44.
24. DOVIER, A., PIAZZA, C., AND POLICRITI, A. 2000a. Comparing Expressiveness of Set Constructor Symbols. In Frontiers of Combining Systems, FroCoS'2000, H. Kirchner and C. Ringeissen, Eds. Number 1794 in Lecture Notes in Computer Science. Springer Verlag, Berlin, 275-289. Nancy, France.
25. DOVIER, A., PIAZZA, C., PONTELLI, E., AND ROSSI, G. 1998a. On the Representation and Management of Finite Sets in CLP-languages. In Proc. of 1998 Joint International Conference and Symposium on Logic Programming, J. Jaffar, Ed. The MIT Press, Cambridge, Mass., 40-54. Manchester, UK.
26. DOVIER, A., POLICRITI, A., AND ROSSI, G. 1998b. A Uniform Axiomatic View of Lists, Multisets and the Relevant Unification Algorithms. Fundamenta Informaticae 36, 2/3, 201-234.
27. DOVIER, A., PONTELLI, E., AND ROSSI, G. 1998c. Set Unification Revisited. NMSU-CSTR-9817, Dept. of Computer Science, New Mexico State University, USA. October. Submitted.
28. DOVIER, A., PONTELLI, E., AND ROSSI, G. 2000b. A Necessary Condition for Constructive Negation in Constraint Logic Programming. Information Processing Letters 74, 3-4, 147-156.
29. DOVIER, A., PONTELLI, E., AND ROSSI, G. 2000c. Constructive Negation and Constraint Logic Programming with Sets. New Generation of Computing, (To appear).
30. FAGES, F. 1987. Associative-Commutative Unification. Journal of Symbolic Computation 3, 257-275.
31. GERVET, C. 1997. Interval Propagation to Reason about Sets : Definition and Implementation of a Practical Language. International Journal of Constraints 1, 1, 191-246.
32. HEINTZE, N. AND JAFFAR, J. 1994. Set Constraints and Set-Based Analysis. Technical report, Carnegie Mellon University.
33. HILL, P. M. AND LLOYD, J. W. 1994. The Gödel Programming Language. The MIT Press, Cambridge, Mass.
34. e, User Manual. Tech. rep., Imperial College, London. August. Available at www.icparc.ic.ac.uk/eclipse.
35. JAFFAR, J. AND MAHER, M. J. 1994. Constraint Logic Programming: A Survey. Journal of Logic Programming 19-20, 503-581.
36. JAFFAR, J., MAHER, M. J., MARRIOTT, K., AND STUCKEY, P. J. 1998. The Semantics of Constraint Logic Programs. Journal of Logic Programming 37, 1-3, 1-46.
37. JANA, D. AND JAYARAMAN, B. 1999. Set Constructors, Finite Sets, and Logical Semantics. Journal of Logic Programming 38, 1, 55-77.
38. JAYARAMAN, B. AND MOON, K. 1995. The SuRE Programming Framework. In Algebraic Methodology and Software Technology, 4th International Conference, AMAST '95, V. S. Alagar and M. Nivat, Eds. Lecture Notes in Computer Science, vol. 936. Springer-Verlag, Berlin, 585. Montreal, Canada, July 3-7.
39. JAYARAMAN, B. AND PLAISTED, D. A. 1989. Programming with Equations, Subsets and Relations. In Proceedings of NACLP89, E. Lusk and R. Overbeek, Eds. The MIT Press, Cambridge, Mass., 1051-1068. Cleveland.
40. KAPUR, D. AND NARENDRAN, P. 1992. Complexity of Unification Problems with Associative-Commutative Operators. Journal of Automated Reasoning 9, 261-288.
41. KUPER, G. M. 1990. Logic Programming with Sets. Journal of Computer and System Science 41, 1, 66-75.
42. LEGEARD, B. AND LEGROS, E. 1991. Short Overview of the CLPS System. In Proc. Third International Symposium on Programming Language Implementation and Logic Programming, J. Maluszynski and M. Wirsing, Eds. Lecture Notes in Computer Science, vol. 528. Springer-Verlag, Berlin, 431-433. Passau, Germany.
43. LIU, M. 1995. Relationlog: A Typed Extension to Datalog with Sets and Tuples. In Proceedings of the International Symposium on Logic Programming, J. W. Lloyd, Ed. The MIT Press, Cambridge, Mass., 83-97.
44. LIVESEY, M. AND SIEKMANN, J. 1976. Unification of Sets and Multisets. Technical report, Institut für Informatik I, Universität Karlsruhe.
45. LLOYD, J. W. 1999. Programming in an Integrated Functional and Logic Language. Journal of Logic Programming 1999, 3, 1-49.
46. MAHER, M. 1988. Complete Axiomatizations of the Algebras of finite, infinite and rational Trees. In Proc. third Annual Symposium on Logic in Computer Science. Computer Society Press, 348-359.
47. MAKINOUCHI, A. 1977. A Consideration on Normal Form of Not-necessarily-normalized Relation in the Relational Data Model. In Procs. International Con on Very Large Databases. ACM Press, 447-453.
48. MAL'CEV, A. 1971. Axiomatizable Classes of Locally Free Algebras of Various Types. In The Metamathematics of Algebraic Systems. Collected Papers. North Holland, Chapter 23.
49. MARTELLI, A. AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4, 258-282.
50. MUNAKATA, T. 1992. Notes on Implementing Sets in Prolog. Communications of the ACM 35, 3 (Mar.), 112-120.
51. NAISH, L. 1986. Negation and Control in PROLOG. Lecture Notes in Computer Science, vol. 238. Springer-Verlag Inc., New York, NY, USA.
52. OMODEO, E. G. AND POLICRITI, A. 1995. Solvable Set/Hyperset Contexts: I. Some Decision Procedures for the Pure, Finite Case. Communication on Pure and Applied Mathematics 9-10, 1123-1155.
53. PAIGE, R. AND TARJAN, R. E. 1987. Three Partition Refinement Algorithms. SIAM Journal on Computing 16, 6 (Dec.), 973-989.
54. PATERSON, M. S. AND WEGMAN, M. N. 1978. Linear Unification. Journal of Computer System Science 16, 2, 158-167.
55. ROBINSON, A. 1963. Introduction to Model Theory and to the Metamathematics of Algebra. North Holland.
56. SCHWARTZ, J. T., DEWAR, R. B. K., DUBINSKY, E., AND SCHONBERG, E. 1986. Programming with Sets, an Introduction to SETL. Springer-Verlag, Berlin.
57. SHMUELI, O., TSUR, S., AND ZANIOLO, C. 1992. Compilation of Set Terms in the Logic Data Language (LDL). Journal of Logic Programming 12, 1, 89-120.
58. SIEKMANN, J. 1989. Unification Theory. Journal of Symbolic Computation 7(3,4):207-274.
59. SMOLKA, G. 1995. The OZ Programming Model. In Computer Science Today: Recent Trends and Developments, J. van Leeuwen, Ed. Lecture Notes in Computer Science, vol. 1000. Springer-Verlag, Berlin, 324-343.
60. SPIVEY, J. M. 1992. The Z Notation: A reference Manual, 2nd edition. International Series in Computer Science. Prentice Hall.
61. STEFANSSON, K. 1994. Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Paris, France, 137-141.
62. STERLING, L. AND SHAPIRO, E. 1996. The Art of Prolog. The MIT Press, Cambridge, Mass.
63. STOLZENBURG, F. 1999. An Algorithm for General Set Unification and Its Complexity. Journal of Automated Reasoning 22, 1, 45-63.
64. STUCKEY, P. J. 1995. Negation and Constraint Logic Programming. Information and Computation 1, 12-33.
65. VAN ROY, P. 1999. Logic Programming in Oz with Mozart. In International Conference on Logic Programming, D. D. Schreye, Ed. The MIT Press, Cambridge, Mass., 38-51.
66. WALINSKI, C. 1989. CLP(Σ*): Constraint Logic Programming with Regular Sets. In Proc. 6th International Conf. on Logic Programming, G. Levi and M. Martelli, Eds. The MIT Press, Cambridge, Mass., 181-196.