Abstract
We propose a parametric introduction of intensionally defined sets into any \(CLP(\mathcal \{D\})\) language. The result is a language \(CLP({\mathcal \{D\}})\), where constraints over sets of elements of \(\mathcal D\) and over sets of sets of elements, and so on, can be expressed. The semantics of \(CLP({\mathcal \{D\}})\) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in \(CLP({\mathcal \{D\}})\) and propose algorithms for constraints simplification.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arenas-Sánchez, P., Rodríguez-Artalejo, M.: A General Framework for Lazy Funct’l Logic Programming with Algebraic Polymorphic Types. TPLP 2(1) (2001)
Beeri, C., Naqvi, S., Shmueli, O., Tsur, S.: Set Constructors in a Logic Database Language. Journal of Logic Programming 10(3), 181–232 (1991)
Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: Integrating Finite Domain Constraints and CLP with Sets. In: PPDP 2003, pp. 219–229. ACM Press, New York (2003)
Denecker, M., et al.: Ultimate well-founded and stable semantics for logic programs with aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 212–226. Springer, Heidelberg (2001)
Dovier, A., Omodeo, E.G., Pontelli, E., Rossi, G.: {log}: A Logic Programming Language with Finite Sets. In: ICLP, pp. 111–124. MIT Press, Cambridge (1991)
Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: Sets and Constraint Logic Programming. ACM TOPLAS 22(5), 861–931 (2000)
Dovier, A., Pontelli, E., Rossi, G.: A Necessary Condition for Constructive Negation in Constraint Logic Programming. IPL 74(3-4), 146–156 (2000)
Dovier, A., Pontelli, E., Rossi, G.: Constructive Negation and Constraint Logic Programming with Sets. New Generation Computing 19(3), 209–255 (2001)
Gelfond, M.: Representing Knowledge in A-Prolog. In: Computational Logic: Logic Programming and Beyond, pp. 413–451. Springer, Heidelberg (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: JICSLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints 1, 191–246 (1997)
Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming, 19–20, 503–581 (1994)
Jayaraman, B.: Implementation of Subset-Equational Programs. Journal of Logic Programming 12(4), 299–324 (1992)
Kemp, D.B., Stuckey, P.J.: Semantics of Logic Programs with Aggregates. In: ILPS, pp. 387–401. MIT Press, Cambridge (1991)
Kuper, G.M.: Logic Programming with Sets. JCSS 41(1), 66–75 (1990)
Marek, V.W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)
Niemela, I., Simons, P.: Extending Smodels with Cardinality and Weight Constraints. In: Logic-Based Artificial Intelligence, pp. 491–521. Kluwer, Dordrecht (2000)
Ross, K.A., Sagiv, Y.: Monotonic Aggregation in Deductive Databases. Journal of Computer ans System Science 54, 79–97 (1997)
Ross, K.A., Srivastava, D., Stuckey, P.J., Sudarshan, S.: Foundations of aggregation constraints. Theoretical Computer Science 193(1-2), 149–179 (1998)
Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., Schonberg, E.: Programming with Sets: an Introduction to SETL. Springer, Heidelberg (1986)
Van Gelder, A.: The Well-Founded Semantics of Aggregation. In: 11th Principles of Database Systems, pp. 127–138. ACM Press, New York (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dovier, A., Pontelli, E., Rossi, G. (2003). Intensional Sets in CLP . In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive