J. Jaffar
ABSTRACT
We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach, we define a class of programming languages, the CLP languages, all of which share the same essential semantic properties. From a conceptual point of view, CLP programs are highly declarative and are soundly based within a unified framework of formal semantics. This framework not only subsumes that of logic programming, but satisfies the core properties of logic programs more naturally. From a user's point of view, CLP programs have great expressive power due to the constraints which they naturally manipulate. Intuition in the reasoning about programs is enhanced as a result of working directly in the intended domain of discourse. This contrasts with working in the Herbrand Universe wherein every semantic object has to be explicitly coded into a Herbrand term; this enforces reasoning at a primitive level. Finally, from an implementor's point of view, CLP systems can be efficient because of the exploitation of constraint solving techniques over specific domains.
- 1.H. Ait-Kaei and R. Nasr, LOGIN: A Logic Programming Language with Built-In Inheritance, Jour. nal of Logic Programming, 3(3), 1986. Google Scholar
Digital Library
- 2.A. Boming, THINGLAB - A Constraint Orientated Simulation Laboratory, A CM TOPLAS, 3(4), 1981.Google Scholar
- 3.A. Colmerauer, Prolog and Infinite Trees, in: Logic Programming, K.L. Clark and S.A. Tarnhmd (Eds.), Academic Press, New York, 1982.Google Scholar
- 4.A. Colmerauer, Solving Equations and Inequations on Finite and Infinite Trees, Proc. Conference on Fifth Generation Computer Systems, Tokyo, November 1984.Google Scholar
- 5.D. DeGroot and G. Lindstrom (eds.), Logic Programming: Relations, Functions and Equations, Prentice, Hall, 1986. Google ScholarDigital Library
- 6.J. Jaffar and J-L. Lassez, Constraint Logie Programruing, Technical Report, Department of Computer Science, Monash University, June 1986.Google Scholar
- 7.N.C. Helntze, J. Jaffar, C.S. Lira, S. Michaylov, P.J. Stuckey, R. Yap and C.N. Yee, The CLP Programmer's Manual, Department of Computer Science, Monash University, June 1986.Google Scholar
- 8.J. Jaffar, J-L. Lassez and M.J. Mailer, A Logic Programming Language Scheme, in" Logic Programming: Relations, Functions and ~quations, D. DeGroot, G. Lindstrom (eds.), Prentice Hall, 1986.Google Scholar
- 9.J. Jaffar, J-L. Lassez and M.J. Maher, PROLOG-II as an Instance of the Logic Programming Language Scheme, in Formal Descriptions of Programming Concepts, M. Wirsing (Ed), North-HoUand, 1986.Google Scholar
- 10.J. Jaffar, J-L. Lassez and M.j. Maher, Issues and Trends in the Semantics of Logic Programming, Proc. 3rd International Conference on Logic Programming, London, July 1986. Google ScholarDigital Library
- 11.J. Jaffar and S. Michaylov, Methodology and Implementation of a Constraint Logic Programming System, Technical Report, Computer Science Dept., Monash University, June 1986.Google Scholar
- 12.J. Jaffar and P.j. Stuckey, Canonical Logic Programs, Journal of Logic Programming, 3(2), 1986. Google ScholarDigital Library
- 13.J. Jaffar and P.J. Stuckey, Semantics of Infinite Tree Logic Programming, Theoretical Computer Science, to appear. Google ScholarDigital Library
- 14.J. Jaffar and P.J. Stuckey, A Separation Algorithm for Theories with Uainterpreted Functors, Forthcoming.Google Scholar
- 15.K. Mukai and H. Yasukawa, Complex Indeterminates in PROLOG and its Application to Discourse Models, New Generation Computing, 3, 1985. Google ScholarDigital Library
- 16.G.L. Steele, The Definition and Implementation of a Computer Programming Language based on Constraints, Ph.D. Thesis, M.I.T. AI-TR 595, 1980. Google ScholarDigital Library
Index Terms
- Constraint logic programming
Recommendations
Negation and Constraint Logic Programming
Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint ...
Coinductive constraint logic programming
FLOPS'12: Proceedings of the 11th international conference on Functional and Logic ProgrammingConstraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (...
Constraint Logic Programming with Hereditary Harrop formulas
Constraint Logic Programming (CLP) and Hereditary Harrop formulas (HH) are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof ...
Comments