S. Menju et al., A Study on Boolean Constraint Solvers, Constraint Logic Programming: Selected Research, (F. Benhamou and A. Colmerauer, Eds.), MIT Press, Cambridge, Mass., USA, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....logic, e.g. and, or, neg, imp, exor, modeled here as relations. We assume that equality = is a built in constraint. The program bool.chr 8 is a simple solver mainly based on value propagation using single headed simplification rules and automatic labeling. For more sophisticated algorithms see [Me 93]. We can define an and gate with constraint handling rules (assuming that variables can only take Boolean values) and(X,Y,Z) X=0 Z=0. and(X,Y,Z) Y=0 Z=0. and(X,Y,Z) X=1 Y=Z. and(X,Y,Z) Y=1 X=Z. and(X,Y,Z) Z=1 X=1,Y=1. and(X,Y,Z) X=Y Y=Z. For ....

S. Menju et al., A Study on Boolean Constraint Solvers, Constraint Logic Programming: Selected Research, (F. Benhamou and A. Colmerauer, Eds.), MIT Press, Cambridge, Mass., USA, 1993.

No context found.

S. Menju et al., A Study on Boolean Constraint Solvers, Constraint Logic Programming: Selected Research, (F. Benhamou and A. Colmerauer, Eds.), MIT Press, Cambridge, Mass., USA, 1993.

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