Abstract
The constraint paradigm plays a more and more important role in knowledge based systems and declarative programming. This is because because it caters for implicit information and the representation of fundamental domains of computation. In particular constraint solving can advantageously replace unification as it corresponds better to programming practice and existing trends in language design. Furthermore the introduction of constraints in Logic Programming preserves and enhances very naturally the desirable semantic properties of Logic Programs. We give here a brief exposition of the motivations that led to the CLP theory, an overview of the language CLP (ℛ), an example of application in Stock Options Trading and finally we mention a number of important activities in the area of Constraints and Logic Programming.
Preview
Unable to display preview. Download preview PDF.
Bibliography
A. Colmerauer, "Opening the PROLOG-III Universe", Byte Magazine, Special Issue on Logic Programming, August 1987.
H. Comon, "Unification et Disunification: Theorie et Applications", PhD Thesis, Grenoble 88.
N.C. Heintze, S. Michaylov, P.J. Stuckey, "On the Applications of CLP to Some Problems in Electrical Engineering", Proc. ICLP-4, Melbourne, 1987.
N.C. Heintze, J. Jaffar, C.S. Lim, S. Michaylov, P.J. Stuckey, R. Yap, C.N. Yee, "The CLP(ℛ) Programmer's manual", Technical Report, Dept. of Computer Science, Monash University, June 1986.
T. Imielinski, "Intelligent query answering in rule based systems", Journal of Logic Programming 4(3), Sept 1987.
J. Jaffar, J-L. Lassez and M.J. Maher, "A Logic Programming Language Scheme", in Logic Programming: Relations, Functions and Equations", D. DeGroot and G. Lindstrom (Eds), Prentice-Hall, 1985.
J. Jaffar and J-L. Lassez, "Constraint Logic Programming", Proc. POPL-87, Munich, 1987.
J. Jaffar and J-L. Lassez, "Constraint Logic Programming", Technical report, Department of Computer Science, Monash University, June 1986.
J. Jaffar and S. Michaylov, "Methodology and Implementation of a CLP system", Proc. ICLP-4, Melbourne, 1987.
J. Jaffar, S. Michaylov, P. Stuckey and R. Yap, "The CLP(ℛ) Language and System", To Appear.
K. Kunen, "Answer Sets and Negation-as-Failure", Proc. ICLP-4, Melbourne, May 1987.
C. Lassez, "Constraint Logic Programming", Byte Magazine, Special Issue on Logic Programming, August 1987.
C. Lassez, K. McAloon and R. Yap, "Constraint Logic Programming and Option Trading", IEEE Expert, Special Issue on Financial Software, August 1987.
J-L. Lassez and K. Marriott, "Explicit Representation of Terms defined by Counter Examples", Journal of Automated Reasoning, Sept 87 (also IBM Research Report 1986).
J-L. Lassez, M. Maher and K. Marriott, "Unification Revisited", to appear in Foundations of Deductive Databases and Logic Programming, J. Minker editor, Morgan Kaufman 1987 (also IBM Research Report 1986).
J-L Lassez and K. McAloon, "A Canonical Form for Generalized Linear Arithmetic Constraints", to appear.
J-L Lassez, M. Maher and P. Stuckey, In preparation.
M. Maher, "Complete axiomatizations of the algebras of finite, rational and infinite trees", Proc. LICS-88, Edinburgh 1988.
M. Maher, "Logic Semantics for a Class of Committed-Choice Programs", Proc. ICLP-4, Melbourne, May 1987.
P. Mancarella, S. Martini and D. Pedreschi, "Complete Logic Programs with domain closure axioms", To appear in the Journal of Logic Programming.
C.K. Mohan, M.K. Srivas and D. Kapur, Forward Reasoning in Systems of Equations and Inequations, to appear, Journal of Logic Programming.
K. Mukai and H. Yasukawa, "Complex Indeterminates in PROLOG and its application to discourse models", New Generation Computing 3, 1985.
K. Sakai and A. Aiba, "Introduction to CAL", ICOT Memo, 1987
P. van Hentenryck and M. Dincbas, "Forward Checking in Logic Programming", Proc. ICLP-4, Melbourne, May 1987.
M. Wallace, "Negation by Constraints — a sound and efficient implementation of negation in deductive databases", Proc. SLP-4, San Francisco, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaffar, J., Lassez, JL. (1988). From unification to constraints. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '87. LP 1987. Lecture Notes in Computer Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19426-6_1
Download citation
DOI: https://doi.org/10.1007/3-540-19426-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19426-2
Online ISBN: 978-3-540-39267-5
eBook Packages: Springer Book Archive