Abstract
We address the problem of determining those constraint domains A for which the traditional logic programming semantics and the constraint logic programming semantics CLP(A) coincide. This reduces to a study of non-standard models of Clark's axioms and the notion of solution compactness introduced in the CLP scheme. The results of this study include the proof of the existence of a free product in the class of algebras defined by Clark's axioms, a characterization of when Clark's axioms form a model complete theory, and a limited characterization of those models of Clark's axioms which form solution compact constraint domains.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Blair & K. Bowen, private communication, 1988.
H. Blair & A. Brown, Definite Clause Programs are Canonical (Over a Suitable Domain), Annals of Mathematics and Artificial Intelligence, to appear.
C.C. Chang & H.J. Keisler, Model Theory, third edition, North-Holland, 1990.
K.L. Clark, Negation as Failure, in Logic and Databases, H. Gallaire and J. Minker (Eds.), Plenum Press, New York, 293–322, 1978.
H. Comon, Disunification: A Survey, in: Computational Logic, J-L. Lassez & G. Plotkin (Eds.), MIT Press, 1991.
H. Comon and P. Lescanne, Equational Problems and Disunification, J. Symb. Comp. 7, 371–425, 1989.
K. Doets, Levationis Laus, Technical Report CT-91-08, Institute for Language, Logic and Information, University of Amsterdam, 1991.
J. Jaffar & J-L. Lassez, Constraint Logic Programming, Technical Report, Department of Computer Science, Monash University, 1986.
J. Jaffar & J-L. Lassez, Constraint Logic Programming, Proc. Conf. on Principles of Programming Languages, 1987, 111–119.
J. Jaffar, J-L. Lassez & J. Lloyd, Completeness of the Negation-as-Failure Rule, Proc. 8th. International Joint Conference on Artificial Intelligence, 1983.
J. Jaffar, J-L. Lassez & M. Maher, Some Issues and Trends in the Semantics of Logic Programming, Proc. 3rd. International Conference on Logic Programming, LNCS 225, 223–241, 1986.
J. Jaffar & P. Stuckey, Canonical Logic Programs, Journal of Logic Programming, 3, 143–155, 1986.
K. Kunen, Negation in Logic Programming, Journal of Logic Programming, 4, 289–308, 1987.
K. Kunen, Answer Sets and Negation as Failure, Proc. 4th. International Conference on Logic Programming, Melbourne, 219–228, 1987.
J-L. Lassez, M.J. Maher & K.G. Marriott, Unification Revisited, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed.), Kauffman, 1987.
G. Levi, M. Martelli & C. Palamidessi, Failure and Success made Symmetric, Proc. North American Conference on Logic Programming, 3–22, 1990.
J.W. Lloyd, Foundations of Logic Programming, Springer-Verlag, second edition, 1987.
M.J. Maher, Logic Semantics for a Class of Committed-Choice Programs, Proc. 4th International Conference on Logic Programming, Melbourne, Australia, May 1987, 858–876.
M.J. Maher, Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees, Proc. 3rd. Symp. Logic in Computer Science, Edinburgh, 348–357, 1988. Full version: IBM Research Report, T.J. Watson Research Center.
M.J. Maher, Equivalences of Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 627–658, 1988.
A. Mal'cev, Axiomatizable Classes of Locally Free Algebras of Various Types, in: The Metamathematics of Algebraic Systems: Collected Papers, 1936–1967, Chapter 23, 262–281, 1971.
G. Marongiu & S. Tulipani, Quantifiers elimination for Complete Extensions of Clark Equational Theory, Research Report, Universita di Bologna, 1989.
J. Plaza, Fully Declarative Programming with Logic: Mathematical Foundations, Ph.D. thesis, City University of New York, 1990.
A. Robinson, Complete Theories, North-Holland, 1956.
J.C. Shepherdson, Negation in Logic Programming, in: Foundations of Deductive Databases and Logic Programming, J. Minker (Ed), Morgan Kaufmann, 19–88, 1988.
J.C. Shepherdson, Language and Equality Theory in Logic Programming, Technical Report, University of Bristol.
M. Wallace, A Computable Semantics for General Logic Programs, Journal of Logic Programming 6, 269–297, 1989.
D.A. Wolfram, M.J. Maher & J-L. Lassez, A Unified Treatment of Resolution Strategies for Logic Programs, Proc. 2nd International Logic Programming Conference, Uppsala, Sweden, July 1984, 263–276.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, M.J. (1992). A CLP view of logic programming. In: Kirchner, H., Levi, G. (eds) Algebraic and Logic Programming. ALP 1992. Lecture Notes in Computer Science, vol 632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013838
Download citation
DOI: https://doi.org/10.1007/BFb0013838
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55873-6
Online ISBN: 978-3-540-47302-2
eBook Packages: Springer Book Archive
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.
