/usr/share/mozart/doc/fdt/idx.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>Index</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="bib.html#label192"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD></TR></TABLE><H1><A name="label193">Index</A></H1><CENTER><TABLE border="1" cellpadding="2"><TR><TD><A href="#_B">B</A></TD><TD><A href="#_C">C</A></TD><TD><A href="#_D">D</A></TD><TD><A href="#_E">E</A></TD><TD><A href="#_F">F</A></TD><TD><A href="#_G">G</A></TD><TD><A href="#_I">I</A></TD><TD><A href="#_L">L</A></TD><TD><A href="#_M">M</A></TD><TD><A href="#_N">N</A></TD><TD><A href="#_O">O</A></TD><TD><A href="#_P">P</A></TD><TD><A href="#_R">R</A></TD><TD><A href="#_S">S</A></TD><TD><A href="#_T">T</A></TD><TD><A href="#_V">V</A></TD></TR></TABLE></CENTER><H3 class="margin"><A name="_B">B</A></H3><DL><DT><A>basic constraint</A>: <A href="node3.html#label13">2.1 Finite Domains and Constraints</A></DT></DL><DL><DT><A>better</A>: <A href="node43.html#label121">10 Branch and Bound</A></DT></DL><DL><DT><A>branch and bound</A>: <A href="node43.html#label120">10 Branch and Bound</A></DT></DL><H3 class="margin"><A name="_C">C</A></H3><DL><DT><A>capacity constraint</A>: <A href="node47.html#label139">Model</A></DT></DL><DL><DT><A>closed choice node</A>: <A href="node16.html#label49">3.3 The Explorer</A></DT></DL><DL><DT><A>constraint</A>: <A href="node3.html#label11">2.1 Finite Domains and Constraints</A></DT></DL><DL><DT><A>constraint store</A>: <A href="node5.html#label18">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>critical resource</A>: <A href="node50.html#label158">11.4 Strong Serializers</A></DT></DL><H3 class="margin"><A name="_D">D</A></H3><DL><DT><A>declarative semantics</A>: <A href="node5.html#label22">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>defined constraint</A>: <A href="node22.html#label60">4.2 Example: Family</A></DT></DL><DL><DT><A>demand</A>: <A href="node50.html#label154">11.4 Strong Serializers</A></DT></DL><DL><DT><A>determines</A>: <A href="node5.html#label23">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>distribution strategy</A>: <A href="node10.html#label36">2.8 Distribution Strategies</A></DT></DL><DL><DT><A>distributor</A>: <A href="node10.html#label35">2.8 Distribution Strategies</A></DT></DL><DL><DT><A>domain constraint</A>: <A href="node3.html#label12">2.1 Finite Domains and Constraints</A></DT></DL><DL><DT><A>Domain propagation</A>: <A href="node6.html#label32">2.4 Interval and Domain Propagation</A></DT></DL><DL><DT><A>domain splitting</A>: <A href="node10.html#label37">2.8 Distribution Strategies</A></DT></DL><H3 class="margin"><A name="_E">E</A></H3><DL><DT><A>edge-finding</A>: <A href="node49.html#label152">11.3 Strong Propagators for Capacity Constraints </A></DT></DL><DL><DT><A>entailed</A>: <A href="node5.html#label26">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><H3 class="margin"><A name="_F">F</A></H3><DL><DT><A>failed</A>: <A href="node5.html#label25">2.3 Spaces, Propagators, and Constraint Stores</A>, <A href="node5.html#label28">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>finite domain</A>: <A href="node3.html#label10">2.1 Finite Domains and Constraints</A></DT></DL><DL><DT><A>finite domain problem</A>: <A href="node3.html#label14">2.1 Finite Domains and Constraints</A></DT></DL><DL><DT><A>first-class space</A>: <A href="node17.html#label50">3.4 New Primitives</A></DT></DL><DL><DT><A>first-fail distribution strategy</A>: <A href="node10.html#label39">2.8 Distribution Strategies</A></DT></DL><H3 class="margin"><A name="_G">G</A></H3><DL><DT><A>global slack</A>: <A href="node50.html#label155">11.4 Strong Serializers</A></DT></DL><H3 class="margin"><A name="_I">I</A></H3><DL><DT><A>inconsistent</A>: <A href="node5.html#label24">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>interval propagation</A>: <A href="node6.html#label33">2.4 Interval and Domain Propagation</A></DT></DL><H3 class="margin"><A name="_L">L</A></H3><DL><DT><A>least regret</A>: <A href="node45.html#label125">Distribution Strategy</A></DT></DL><DL><DT><A>local slack</A>: <A href="node50.html#label157">11.4 Strong Serializers</A></DT></DL><H3 class="margin"><A name="_M">M</A></H3><DL><DT><A>makespan</A>: <A href="node47.html#label130">Model</A></DT></DL><DL><DT><A>model</A>: <A href="node12.html#label40">2.10 Models</A></DT></DL><H3 class="margin"><A name="_N">N</A></H3><DL><DT><A>naive distribution strategy</A>: <A href="node10.html#label38">2.8 Distribution Strategies</A></DT></DL><H3 class="margin"><A name="_O">O</A></H3><DL><DT><A>open choice node</A>: <A href="node16.html#label48">3.3 The Explorer</A></DT></DL><DL><DT><A>operational semantics</A>: <A href="node5.html#label21">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>ordered</A>: <A href="node47.html#label144">Ordering Tasks by Distribution</A></DT></DL><H3 class="margin"><A name="_P">P</A></H3><DL><DT><A>parent</A>: <A href="node17.html#label51">3.4 New Primitives</A></DT></DL><DL><DT><A>posting of constraints</A>: <A href="node15.html#label47">Posting of constraints</A></DT></DL><DL><DT><A>precedence constraints</A>: <A href="node47.html#label129">Model</A></DT></DL><DL><DT><A>propagators</A>: <A href="node5.html#label19">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><H3 class="margin"><A name="_R">R</A></H3><DL><DT><A> recomputation</A>: <A href="node53.html#label177">Use Recomputation if Memory Consumption is a Problem</A></DT></DL><DL><DT><A>Redundant constraints</A>: <A href="node30.html#label87">7 Propagators for Redundant Constraints</A></DT></DL><DL><DT><A>resource</A>: <A href="node47.html#label137">Model</A></DT></DL><DL><DT><A>resource-oriented serializer</A>: <A href="node50.html#label159">11.4 Strong Serializers</A></DT></DL><H3 class="margin"><A name="_S">S</A></H3><DL><DT><A>scheduling compiler</A>: <A href="node47.html#label133">Script</A></DT></DL><DL><DT><A>script</A>: <A href="node13.html#label41">3 Writing Problem Solvers in Oz</A></DT></DL><DL><DT><A>search tree</A>: <A href="node8.html#label34">2.6 Distribution and Search Trees</A></DT></DL><DL><DT><A>serialization</A>: <A href="node47.html#label138">Model</A></DT></DL><DL><DT><A>serialize</A>: <A href="node47.html#label141">11.1.3 Building a House: Serializers</A></DT></DL><DL><DT><A>serializer</A>: <A href="node47.html#label142">11.1.3 Building a House: Serializers</A></DT></DL><DL><DT><A>solution</A>: <A href="node3.html#label16">2.1 Finite Domains and Constraints</A>, <A href="node5.html#label31">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>solved</A>: <A href="node5.html#label30">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>space</A>: <A href="node5.html#label17">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>stable</A>: <A href="node5.html#label27">2.3 Spaces, Propagators, and Constraint Stores</A>, <A href="node5.html#label29">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><DL><DT><A>supply</A>: <A href="node50.html#label153">11.4 Strong Serializers</A></DT></DL><H3 class="margin"><A name="_T">T</A></H3><DL><DT><A>task-oriented serializer</A>: <A href="node51.html#label161">11.5.1 The Problem ABZ6</A></DT></DL><DL><DT><A>task interval</A>: <A href="node50.html#label156">11.4 Strong Serializers</A></DT></DL><DL><DT><A>tell</A>: <A href="node5.html#label20">2.3 Spaces, Propagators, and Constraint Stores</A></DT></DL><H3 class="margin"><A name="_V">V</A></H3><DL><DT><A>variable assignment</A>: <A href="node3.html#label15">2.1 Finite Domains and Constraints</A></DT></DL><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="bib.html#label192"><< Prev</A></TD><TD><A href="index.html">- Up -</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>
|