Pascal Van Hentenryck and Vijay A. Saraswat. cc(FD): Constraint programming over finite domains. Technical report, Computer Science Department, Brown University, forthcoming 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to achieve the same functionality as the original solvers. The benefit comes from the fact that these combinators substantially enhance the operational expressiveness of the language by making available at the language level the pruning abstraction used in the implementation. The work on cc(FD) [88] exemplifies this approach. It shows that the finite domain part of CHIP [84] can be reconstructed as an instance of the cc framework with primitive constraints involving at most one variable. The new combinators include several forms of disjunctions (e.g. cardinality [86] constructive ....

P. Van Hentenryck and Vijay A. Saraswat. cc(FD): Constraint programming over finite domains. Technical report, Computer Science Department, Brown University, forthcoming 1991.

....evaluation. In a similar manner, we have explored the design of cc(FS) cc over featurestructures, which can be thought of as particular kinds of record structures (see, for example, AKN86] and of cc(FD) the higher order version of the cc language over the constraint system of finite domains [HS91]. More details will be contained in the full paper. In a similar manner, we have explored the design of cc(FS) cc over featurestructures, which can be thought of as particular kinds of record structures (see, for example, AKN86] and of cc(FD) the higher order version of the cc language over ....

....paper. In a similar manner, we have explored the design of cc(FS) cc over featurestructures, which can be thought of as particular kinds of record structures (see, for example, AKN86] and of cc(FD) the higher order version of the cc language over the constraint system of finite domains [HS91]. 7 Conclusions and Future work This work establishes simple foundations for higher order constraint programming languages. This is done by extending the calculus with notions of parallel composition, and ask abstractions, and disjunction (to get angelic nondeterminism) by introducing the ....

Pascal Van Hentenryck and Vijay A. Saraswat. cc(FD): Constraint programming over finite domains. Technical report, Computer Science Department, Brown University, forthcoming 1991.

....transducer. In this paper we describe a (domain theoretic) semantic foundation for cc languages with ask, tell, parallel composition, hiding, recursion and angelic non determinism ( parallel backtracking ) This class of languages includes the cc Herbrand language [Sar89] and a simpler reworking [HS91] of CHIP. Generalizing previous work on determinate constraint programming [JPP89,SRP91] we describe the semantics for such a language based on modelling a process as a set of constraints, with parallel composition (conjunction) given by set intersection and or parallel search (disjunction) ....

.... programming languages (such as pure Prolog) From a programming point of view, this form of control has been explored in detail in earlier work (e.g. Sar87b,Sar89,SRH91] It has also been embedded within other non deterministic concurrent programming languages such as cc Herbrand [Sar89] and [HS91] which provides a rational reconstruction (and extension) of CHIP [DvH 88] The semantic treatment presented in this paper serves to provide a simple mathematical foundation for these languages. Note that determinate constraint programming [SRP91] and (constraint) logic programming can be ....

Pascal Van Hentenryck and Vijay A. Saraswat. cc(FD): Constraint programming over finite domains. Technical report, Computer Science Department, Brown University, forthcoming 1991.

....computation to fork into two distinct branches, preserving only the (possibly disjunctive) information obtained on both. While simple, these ideas are being used for the design of both programming languages for distributed systems [SKL90] and very powerful languages for symbolic reasoning [HS91,HJ90]. From a computational perspective, the cc paradigm may be seen to generalize (and arose out of) the areas of concurrent logic programming and constraint logic programming. But where are the logical foundations of the (very operationally motivated) cc paradigm In [LS91] we have shown that a ....

Pascal Van Hentenryck and Vijay A. Saraswat. cc(FD): Constraint programming over finite domains. Technical report, Computer Science Department, Brown University, forthcoming 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