<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD><TITLE>2.2 Constraint Propagation</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node3.html#section.constraints.constraints"><< Prev</A></TD><TD><A href="node2.html">- Up -</A></TD><TD><A href="node5.html#section.constraints.spaces">Next >></A></TD></TR></TABLE><DIV id="section.constraints.propagation"><H2><A name="section.constraints.propagation">2.2 Constraint Propagation</A></H2><P>Constraint propagation is an inference rule for finite domain problems that narrows the domains of variables. For instance, given the inequation </P><BLOCKQUOTE><P><IMG alt="X<Y" src="latex21.png"></P></BLOCKQUOTE><P> and the domain constraints </P><BLOCKQUOTE><P><IMG alt="X\in23\#100" src="latex22.png"></P></BLOCKQUOTE><P> and </P><BLOCKQUOTE><P><IMG alt="Y\in1\#33" src="latex23.png"></P></BLOCKQUOTE><P> constraint propagation can narrow the domains of <IMG alt="X" src="latex24.png"> and <IMG alt="Y" src="latex8.png"> to </P><BLOCKQUOTE><P><IMG alt="X\in23\#32" src="latex25.png"></P></BLOCKQUOTE><P> and </P><BLOCKQUOTE><P><IMG alt="Y\in24\#33" src="latex26.png"></P></BLOCKQUOTE><P></P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node3.html#section.constraints.constraints"><< Prev</A></TD><TD><A href="node2.html">- Up -</A></TD><TD><A href="node5.html#section.constraints.spaces">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.ps.uni-sb.de/~smolka/">Gert Smolka</A><BR><SPAN class="version">Version 1.4.0 (20090610)</SPAN></ADDRESS></BODY></HTML>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
bd5c3d824c3db63ffd9226c15941e6ad
>
files
>
1214
