This file is indexed.

/usr/share/mozart/doc/fdt/node35.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>8 Reified 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="node30.html#chapter.propagators">&lt;&lt; Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node40.html#chapter.user-defined">Next &gt;&gt;</A></TD></TR></TABLE><DIV id="chapter.reified"><H1><A name="chapter.reified">8 Reified Constraints</A></H1><P>In this section we will see a new class of constraints called reified constraints. Reified constraints make it possible to express constraints involving logical connectives such as disjunction, implication, and negation. Reified constraints also make it possible to solve overconstrained problems, for which only some of the stated constraints can be satisfied. </P><HR><UL class="toc"><LI><A href="node36.html#section.reified.started">8.1 Getting Started</A><UL class="toc"><LI><A href="node36.html#label100">Exercises</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node37.html#section.reified.photo">8.2 Example: Aligning for a Photo</A><UL class="toc"><LI><A href="node37.html#label101">Problem Specification</A></LI><LI><A href="node37.html#label102">Model</A></LI><LI><A href="node37.html#label103">Distribution Strategy.</A></LI><LI><A href="node37.html#label104">Script.</A></LI><LI><A href="node37.html#label105">Exercises</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node38.html#section.reified.srat">8.3 Example: Self-referential Aptitude Test</A><UL class="toc"><LI><A href="node38.html#label106">Problem Specification</A></LI><LI><A href="node38.html#label107">Model</A></LI><LI><A href="node38.html#label108">Distribution Strategy</A></LI><LI><A href="node38.html#label109">Script</A></LI><LI><A href="node38.html#label110">Exercises</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node39.html#section.reified.bin">8.4 Example: Bin Packing</A><UL class="toc"><LI><A href="node39.html#label111">Problem Specification</A></LI><LI><A href="node39.html#label112">Model</A></LI><LI><A href="node39.html#label113">Distribution Strategy</A></LI><LI><A href="node39.html#label114">Script</A></LI><LI><A href="node39.html#label119">Exercises</A></LI></UL></LI></UL></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node30.html#chapter.propagators">&lt;&lt; Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node40.html#chapter.user-defined">Next &gt;&gt;</A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian&nbsp;Schulte</A> and&nbsp;<A href="http://www.ps.uni-sb.de/~smolka/">Gert&nbsp;Smolka</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>