| K. Marriott and P. J. Stuckey. Programming with constraints: an introduction. MIT Press, 1998. |
....the use of a Constraint Programming system for solving the problem. Diculties in modeling the problem in an suitable way led us to write the programs in C language, although implementing search strategies based on usual techniques in Combinatorial Optimization and Constraint Programming (e.g. [6] for some bibliographic references) Because interesting programming problems were tackled, we think it worthwhile presenting some of the ideas of the designed algorithms. As we shall see, the analysis of the programs results gave us a deep insight on the problem structure, that allows to greatly ....
Marriott K., and Stuckey P.: Programming with Constraints { An Introduction, The MIT Press, 1998.
....to build constraint solvers in HAL. In Section 9 we discuss the current implementation and Section 10 concludes with a discussion of future work. 2 A First Example The basic HAL syntax follows the standard CLP syntax, with variables, literals, rules and predicates de ned as usual (see, e.g. [18] for an introduction to CLP) Our philosophy has been to design a language which is as pure as possible, without unduly compromising eciency. The module system in HAL is similar to that of Mercury. A module is de ned in a le, it imports the modules it uses and has export annotations on the ....
K. Marriott and P.J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.
....modified, the domains of x1 and x2 remain unchanged. The resulting domain D # is boundsconsistent with the constraint c. Notice that bounds propagation has determined less information than domain propagation. Note that common definitions for bounds propagators for x1 = x2 x3 (see for example [11]) do not maintain bounds consistency. For the domain D(x1 ) 4 . 8] D(x2 ) 1 . 3] D(x3 ) 1 . 3] the definition of [11] gives no propagation, but x2 = has no solution. It is relatively straightforward to prove that the propagators defined in Figure 1 maintain bounds consistency. ....
....bounds propagation has determined less information than domain propagation. Note that common definitions for bounds propagators for x1 = x2 x3 (see for example [11] do not maintain bounds consistency. For the domain D(x1 ) 4 . 8] D(x2 ) 1 . 3] D(x3 ) 1 . 3] the definition of [11] gives no propagation, but x2 = has no solution. It is relatively straightforward to prove that the propagators defined in Figure 1 maintain bounds consistency. Theorem 2.4. For all c, the set of propagators defined in Figure 1 maintains bounds consistency for c. We conclude this ....
[Article contains additional citation context not shown here]
K. Marriott and P. J. Stuckey. Programming with Constraints: an Introduction. The MIT Press, 1998.
No context found.
K. Marriott and P. J. Stuckey. Programming with constraints: an introduction. MIT Press, 1998.
No context found.
Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, 1998.
No context found.
K. Marriott, P.J. Stuckey, Programming with Constraints: Introduction, MIT Press, 1998.
No context found.
K. Marriott, P. J. Stuckey, Programming with Constraints: Introduction, MIT Press, 1998.
No context found.
Marriott, K. and Stuckey, P. (1998) Programming with Constraints: An Introduction. MIT Press, Cambridge, MA.
No context found.
Marriott K., Stuckey P.: Programming with Constraints -- An Introduction. MIT Press (1998).
No context found.
K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
No context found.
Marriott, K. and Stuckey, P.J., Programming with Constraints: An Introduction. The MIT Press, 1998.
No context found.
K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
No context found.
K. Marriott and P.J. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA, 1998.
No context found.
K. Marriott and P. J. Stuckey. Programming with Constraint: An Introduction. MIT press, 1990. 70
No context found.
K. Marriott and P.J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1999.
No context found.
Marriott, K. and Stuckey, P. (1998) Programming with Constraints: An Introduction. MIT Press, Cambridge, MA.
No context found.
K. Marriott and P. J. Stuckey. Programming with constraints: an introduction. MIT Press, 1998.
No context found.
Marriott, K., and Stuckey, P. Programming with Constraints: An Introduction. MIT Press, 1998.
No context found.
Marriott K., and Stuckey P.: Programming with Constraints { An Introduction, The MIT Press, 1998.
No context found.
K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
No context found.
K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
No context found.
K. Marriott & P.J. Stuckey, Programming with Constraints : An Introduction, MIT Press, 1998.
No context found.
K. Marriott & P.J. Stuckey, Programming with Constraints : An Introduction, MIT Press, 1998.
No context found.
K. Marriott & P.J. Stuckey, Programming with Constraints : An Introduction, MIT Press, 1998.
No context found.
Marriott K., and Stuckey P.: Programming with Constraints { An Introduction, The MIT Press, 1998.
First 50 documents Next 50
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