P. van Hentenryck, Constraint Logic Programming, The Knowledge Engineering Review, Vol 6:3, 1991, pp 151-194.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....A fundamental issue in CCP is the specification of concurrent systems by means of constraints. CCP came into being during the last decade, arising as a step towards a more general notion of both concurrent logic programming ( dBP94] Sha90] Hog82] and constraint logic programming ( JL87] Hen91] Most notably, the store as valuation conception of von Neumann computing is replaced in CCP by the notion of store as constraint (a constraint is a finite representation of a possibly infinite set of valuations) which provides partial information about the variables (e.g. x y 5) ....

Pascal Van Hentenryck. Constraint logic programming. Technical Report CS-91-05, Department of Computer Science, Brown University, January 1991. Sun, 13 Jul 1997 18:30:15 GMT.

..... 113 A.2 Declarative Semantics . 113 A.3 Operational Semantics . 113 List of Figures 115 Introduction Background Constraint based programming languages, be it constraint logic programming (CLP) [55, 98, 48, 70] or concurrent constraint logic programming [68, 87, 86, 56] enjoy both elegant theoretical properties and practical success. As it runs, a constraint based program successively generates pieces of partial information called constraints. The constraint solver has the task to collect, combine, and ....

....of constraint based programs is hard. Also, one lesson learned from practical applications is that constraints are often heterogeneous and application speci c. Several proposals have been made to allow more exibility and customization of constraint solvers, often termed glass box approaches [36, 98]. The most far reaching proposal is the rule based formalism. In this approach, the constraint propagation is achieved by repeated application of rules. Rule based Constraint Programming Rule based programming began with Arti cial Intelligence rule based systems in the seventies. It is a ....

[Article contains additional citation context not shown here]

P. van Hentenryck. Constraint logic programming. The Knowledge Engineering Review, 6, 1991.

....of constraint based programs is hard. Also, one lesson learned from practical applications is that constraints are often heterogeneous and application speci c. Several proposals have been made to allow more exibility and customization of constraint solvers, often termed glass box approaches [5,16]. The most far reaching proposal is the no box approach: Constraint Handling Rules (CHR) 7] 3 Java Constraint Handling Rules Constraint Handling Rules (CHR) 7] is a high level language especially designed for writing constraint solvers either from scratch or by modifying existing solvers. ....

P. van Hentenryck. Constraint logic programming. The Knowledge Engineering Review, 6, 1991.

....have been made to allow more for flexibility and customization of constraint systems ( glass box or even no box approaches) ffl Demons, forward rules and conditionals in CHIP [D 88] allow the definition of propagation of constraints in a limited way. ffl Constraint combinators in cc(FD) [VH91] allow to build more complex constraints from simpler constraints. ffl Constraints connected to a Boolean variable in BNR Prolog [BeOl92] and nested constraints [Sid93] allow to express any logical formula over primitive constraints. ffl Indexicals in clp(FD) CoDi93] allow to implement ....

....constraint prime(I) and some other constraint prime(J) such that J mod I = 0 holds, i.e. J is a multiple of I, then keep prime(I) but remove prime(J) and execute the body of the rule, true. 2 Syntax and Semantics We assume some familiarity with (concurrent) constraint (logic) programming, e.g. [Sha89, VH91, Sar93, JaMa94]. As a special purpose language, CHR extend a host language with (more) constraint solving capabilities. Auxiliary computations in CHR programs are executed as host language statements. Here the host language is (SICStus) Prolog. For more formal and detailed syntax and semantics of constraint ....

P. Van Hentenryck, Constraint Logic Programming, The Knowledge Engineering Review, Vol 6:3, 1991, pp 151-194. 14

....generalized annotated programming (GAP) and constraint logic programming (CLP) into annotated constraint logic programs (ACLP) and implement it with a generic interpreter. In GAP [KiSu92] atomic formulas can be annotated and special inference rules for the annotated formulas exist. In CLP [JaMa94, VH91], certain predicates are considered to be constraints and are solved efficiently by a special purpose constraint solver. As a basis for ACLP, we propose ACL, a first order logic with constraints where formulas can be annotated. We consider annotations as distinguished terms with a special ....

P. van Hentenryck, Constraint Logic Programming, The Knowledge Engineering Review, Vol 6:3, 1991, pp 151-194. 18

....adequate constraint solver, that extends deduction through built in interpretation of numerical constants and constructs. This requires the introduction of an algebraic semantics. 2. 2 Notations and definitions Of course, our aim is not to present here an exhaustive state of the art in CLP (see [23]) but rather to define the basic CLP notions with respect to the classical LP and ILP terminology [9, 14] Let L = L h [ L c , be a definite clause language without function symbols other than constants, where L h (respectively L c ) defines the set of uninterpreted (resp. interpreted) predicate ....

....oe (expressed as a set of equalities on variables of G) such that Goe belongs to the least Herbrand model of P . An answer to a query G with respect to a CLP program P is not a substitution any more, but a set of consistent constraints such that all atoms in G have been resolved. We refer to [23] for a formal definition of the inference rule used in CLP, as this is beyond the scope of this paper. Definition 2.3 An answer to a CLP goal G with respect to program P is a conjunction of constraints c 1 : c n such that P; T j= 8) c 1 : c n G) or equivalently P j= S (8) c 1 : ....

[Article contains additional citation context not shown here]

P. Van Hentenryck and Deville Y. Constraint Logic Programming. In Proceedings of POPL'97, 1987.

No context found.

P. van Hentenryck, Constraint Logic Programming, The Knowledge Engineering Review, Vol 6:3, 1991, pp 151-194.

No context found.

P. Van Hentenryck. Constraint logic programming. The Knowledge Engineering Review, 6:151-194, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC