Abstract
Problems and solutions related to the introduction of finite set formers and basic operations on sets in a Logic Programming language are discussed. In particular it is shown that a good solution is to begin with a CLP-scheme whose signature ∑ is endowed with two functional symbols: Ø for the empty set and with for the set construction symbol, using the symbols ∈, ∉, =, ≠ as constraint predicate symbols. The axioms of the selected set theory are described, along with the corresponding algebraic interpretation and the constraint satisfiability algorithm. Other usual set operators (such as ⊑, ∪, etc.) are shown to be definable in the extended language. Also, such an approach turns out to be well suited to accommodate for intensional set formers, providing the language is endowed with some form of negation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. Beeri, S. Naqvi et al. Set and Negation in a Logic Database Language. In Proceedings 6 th ACM SIGMOD Symposium, 1987.
D. Chan. Constructive negation based on the completed databases. In Proceedings 1988 Conference and Symposium on Logic Programming, Seattle, Washington.
A. Dovier, E.G. Omodeo, E. Pontelli, and G. Rossi, {log}: A Logic Programming Language with Finite Sets. In Logic Programming: Proceedings of the Eighth International Conference (K.Furukawa, ed.), The MIT Press, 1991, 111–124.
A. Dovier, E.G. Omodeo, E. Pontelli and G. Rossi. Embedding Finite Sets in a Logic Programming Language. Research Report, University of Rome, “La Sapienza”, 1993.
A. Dovier, E.G. Omodeo, E. Pontelli, and G. Rossi. Embedding Finite Sets in a Logic Programming Language. In E. Lamina, P. Mello eds, No. 660 of Lecture Notes in Artificial Intelligence, Springer Verlag.
J. Jaffar and J.L. Lassez. Constraint Logic Programming. Research Report, June 1986.
G.M. Kuper. Logic Programming with Sets. In Proceedings 6 th ACM SIGMOD Symposium, 1987.
B. Legeard and E. Legros. CLPS: A Set Constraint Logic Programming Language. Research Report, Laboratoire d'automatique de Besançon. Institut de Productique, Besançon, France, 1991.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag series Symbolic Computation — Artificial Intelligence, 2nd edition, 1987.
E.G. Omodeo, A. Policriti and G. Rossi. Che genere di Insiemi-Multiinsiemi-Iperinsiemi incorporare nella Programmazione Logica? In ‘GULP 93', Proceedings of 8 th Conference on Locgic Programming. Gizzeria Lido, Italy, 1993.
A. Policriti and J.T.Schwartz. T-Theorem Proving. Research Report, University of Udine and Courant Institute of Mathematical Sciences, New York, 1992.
P.J. Stuckey. Constructive Negation for Constraint Logic Programming. In Proc. Sixth IEEE Symp. on Logic In Computer Science. IEEE Computer Society Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dovier, A. (1994). A language with finite sets embedded in the CLP-scheme. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_51
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive