This file is indexed.

/usr/share/mozart/doc/system/node39.html is in mozart-doc 1.4.0-8ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

1
2
3
4
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>7.6 Reified Propagators</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="node38.html#section.fs.consts">&lt;&lt; Prev</A></TD><TD><A href="node33.html">- Up -</A></TD><TD><A href="node40.html#section.fs.iterating">Next &gt;&gt;</A></TD></TR></TABLE><DIV id="section.fs.reified"><H2><A name="section.fs.reified">7.6 Reified Propagators</A></H2><P></P><DL><DT><A name="label413"></A> <CODE>reified<SPAN class="keyword">.</SPAN>isIn</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>isIn&nbsp;<SPAN class="keyword">+</SPAN>I&nbsp;<SPAN class="keyword">*</SPAN>M&nbsp;$D}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P><IMG alt="\codeinline{oz}{D} \in \{0,1\} \wedge ((\codeinline{oz}{I} \in \codeinline{oz}{M}) \leftrightarrow
\codeinline{oz}{D} = 1)" src="latex147.png"> </P></DD><DT><A name="label415"></A> <CODE>reified<SPAN class="keyword">.</SPAN>areIn</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>areIn&nbsp;<SPAN class="keyword">+</SPAN>Spec&nbsp;<SPAN class="keyword">*</SPAN>M&nbsp;$Ds}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P><I>Spec</I> describes a list of individual elements <I>Is</I>. <I>Is</I> and <I>Ds</I> are lists of the same length such that every element <IMG alt="{\tt
D}_i" src="latex148.png"> of <I>Ds</I> reifies the presence of the corresponding element <IMG alt="{\tt I}_i" src="latex149.png"> of <I>Is</I> in the set <I>M</I>. </P></DD><DT><A name="label417"></A> <CODE>reified<SPAN class="keyword">.</SPAN>include</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>include&nbsp;<SPAN class="keyword">+</SPAN>D1&nbsp;<SPAN class="keyword">*</SPAN>M&nbsp;$D2}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P><I>D2</I> reifies the presence of <I>D1</I> in the set <I>M</I>. This propagator detects in contrast to <CODE>FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>isIn</CODE> earlier if <I>D1</I> is or is not constained in <I>M</I>. </P></DD><DT><A name="label419"></A> <CODE>reified<SPAN class="keyword">.</SPAN>equal</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>equal&nbsp;<SPAN class="keyword">*</SPAN>M1&nbsp;<SPAN class="keyword">*</SPAN>M2&nbsp;$D}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P><I>D</I> reifies the equality of <I>M1</I> and <I>M2</I>. </P></DD><DT><A name="label421"></A> <CODE>reified<SPAN class="keyword">.</SPAN>partition</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reified<SPAN class="keyword">.</SPAN>partition&nbsp;<SPAN class="keyword">+</SPAN>MVs&nbsp;<SPAN class="keyword">+</SPAN>Is&nbsp;<SPAN class="keyword">+</SPAN>MV&nbsp;$Ds}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>The propagator partitions the set value <CODE>MV</CODE> by selecting elements from the list of set values <CODE>MVs</CODE>. The positive integers in <CODE>Is</CODE> denote the cost resp. benefit of the corresponding set value in <CODE>MVs</CODE> if it is selected for the partition. Each element of <CODE>Ds</CODE> is either <CODE>0</CODE> or the corresponding integer value in <CODE>Is</CODE> depending on whether the corresponding set value in <CODE>MVs</CODE> is part of the partition or not. Excluding a set value from the partition is done by constraining the corresponding element of <CODE>Ds</CODE> to <CODE>0</CODE>. An element in <CODE>Ds</CODE> not equal to <CODE>0</CODE> includes the corresponding set value in <CODE>MVs</CODE> in the partition. The propagator ensures a valid partition according to the values of <CODE>Ds</CODE>. </P></DD></DL><P></P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node38.html#section.fs.consts">&lt;&lt; Prev</A></TD><TD><A href="node33.html">- Up -</A></TD><TD><A href="node40.html#section.fs.iterating">Next &gt;&gt;</A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys&nbsp;Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif&nbsp;Kornstaedt</A>, <A href="http://www.ps.uni-sb.de/~homik/">Martin&nbsp;Homik</A>, <A href="http://www.ps.uni-sb.de/~tmueller/">Tobias&nbsp;Müller</A>, <A href="http://www.ps.uni-sb.de/~schulte/">Christian&nbsp;Schulte</A> and&nbsp;<A href="http://www.info.ucl.ac.be/~pvr">Peter&nbsp;Van Roy</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>