P. van Hentenryck, Vijay A. Saraswat, and Y. Deville, Constraint Processing in cc(FD), Chapter in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), Springer LNCS 910, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Theory and Practice of Constraint Handling Rules - Frühwirth (1998) (52 citations) (Correct)
....therefore also the output O2 of the second xor gate must be 0. The query add(1,1,I3, O1,O2] reduces to I3=O2,O1=1. This example illustrates the power of this simple but incomplete solver. Flexibility and Extensions The cardinality constraint combinator was introduced in the CLP language cc(FD) [vH91, HSD95] for finite domains. Here we adapt it for Boolean variables. The Boolean cardinality constraint #(L,U,BL,N) holds if between L and U Boolean variables in the list BL of length N are equal to 1. In the solver, we assume that for a constraint #(L,U,BL,N) the condition L= U,0= U,0= N,L= N initially ....
....to avoid floundering and achieve maximum propagation. Thus the predicates of the event calculus could be called even when the time parameter was unknown. 8.5. Finite domains Finite domains appeared first in CHIP [vH89] more recent and more advanced CLP languages are clp(FD) CoDi96] and cc(FD) [HSD95]. Since integers are used as domain, some arithmetic is possible. The theory underlying this constraint domain is Presburgers arithmetic. It axiomatizes the linear fragment of integer arithmetic and is decidable. The constraint X: Dom means that the value for the variable X must be in the given ....
[Article contains additional citation context not shown here]
P. van Hentenryck, Vijay A. Saraswat, and Y. Deville, Constraint Processing in cc(FD), Chapter in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), Springer LNCS 910, 1995.
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 Theory and.. - Thom Fruhwirth.. (Correct)
No context found.
P. van Hentenryck, Vijay A. Saraswat, and Y. Deville, Constraint Processing in cc(FD), Chapter in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), Springer LNCS 910, 1995.
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