/usr/share/mozart/doc/fdt/node30.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 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>7 Propagators for Redundant Constraints</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="node27.html#chapter.minimizing"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node35.html#chapter.reified">Next >></A></TD></TR></TABLE><DIV id="chapter.propagators"><H1><A name="chapter.propagators">7 Propagators for Redundant Constraints</A></H1><P> For some problems, the performance of a script can be drastically improved by introducing propagators for redundant constraints. <A name="label87"></A><EM>Redundant constraints</EM> are constraints that are entailed by the constraints specifying the problem. Additional propagators for redundant constraints may decrease the size of the search tree by strengthening the propagation component of the script. They may also reduce the number of propagation steps needed to reach stability. </P><HR><UL class="toc"><LI><A href="node31.html#section.propagators.fractions">7.1 Example: Fractions</A><UL class="toc"><LI><A href="node31.html#label88">Problem Specification</A></LI><LI><A href="node31.html#label89">Model</A></LI><LI><A href="node31.html#label90">Distribution Strategy</A></LI><LI><A href="node31.html#label91">Script</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node32.html#section.propagators.pythagoras">7.2 Example: Pythagoras</A><UL class="toc"><LI><A href="node32.html#label92">Problem Specification</A></LI><LI><A href="node32.html#label93">Model</A></LI><LI><A href="node32.html#label94">Distribution Strategy</A></LI><LI><A href="node32.html#label95">Script</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node33.html#section.propagators.squares">7.3 Example: Magic Squares</A><UL class="toc"><LI><A href="node33.html#label96">Problem Specification</A></LI><LI><A href="node33.html#label97">Model</A></LI><LI><A href="node33.html#label98">Distribution Strategy</A></LI><LI><A href="node33.html#label99">Script</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node34.html#section.propagators.exercises">7.4 Exercises</A></LI></UL></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node27.html#chapter.minimizing"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node35.html#chapter.reified">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 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|