/usr/share/mozart/doc/fdt/toc.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>Table of Contents</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="index.html">- Up -</A></TD><TD><A href="node1.html#chapter.intro">Next >></A></TD></TR></TABLE><H1><A name="label1">Table of Contents</A></H1><HR><UL class="toc"><LI><A href="toc.html#label1">Table of Contents</A></LI><LI><A href="node1.html#chapter.intro">1 Introduction</A><UL class="toc"><LI><A href="node1.html#label2">Money</A></LI><LI><A href="node1.html#label3">Safe</A></LI><LI><A href="node1.html#label4">Coloring</A></LI><LI><A href="node1.html#label5">Grocery</A></LI><LI><A href="node1.html#label6">Queens</A></LI><LI><A href="node1.html#label7">More Information</A></LI><LI><A href="node1.html#label8">The Examples</A></LI><LI><A href="node1.html#label9">Acknowledgements</A></LI></UL></LI><LI><A href="node2.html#chapter.constraints">2 Propagate and Distribute</A><UL class="toc"><LI><A href="node3.html#section.constraints.constraints">2.1 Finite Domains and Constraints</A></LI><LI><A href="node4.html#section.constraints.propagation">2.2 Constraint Propagation</A></LI><LI><A href="node5.html#section.constraints.spaces">2.3 Spaces, Propagators, and Constraint Stores</A></LI><LI><A href="node6.html#section.constraints.intdom">2.4 Interval and Domain Propagation</A></LI><LI><A href="node7.html#section.constraints.incomplete">2.5 Incompleteness of Propagation</A></LI><LI><A href="node8.html#section.constraints.dast">2.6 Distribution and Search Trees</A></LI><LI><A href="node9.html#section.constraints.example">2.7 An Example</A></LI><LI><A href="node10.html#section.constraints.distribution">2.8 Distribution Strategies</A></LI><LI><A href="node11.html#section.constraints.order">2.9 Search Order</A></LI><LI><A href="node12.html#section.constraints.models">2.10 Models</A></LI></UL></LI><LI><A href="node13.html#chapter.problem">3 Writing Problem Solvers in Oz</A><UL class="toc"><LI><A href="node14.html#section.problem.script">3.1 Format of Scripts</A></LI><LI><A href="node15.html#section.problem.money">3.2 Example: Send More Money</A><UL class="toc"><LI><A href="node15.html#label42">Problem Specification</A></LI><LI><A href="node15.html#label43">Model</A></LI><LI><A href="node15.html#label44">Distribution Strategy</A></LI><LI><A href="node15.html#label45">Script</A></LI><LI><A href="node15.html#label46">Posting of constraints</A></LI></UL></LI><LI><A href="node16.html#section.problem.explorer">3.3 The Explorer</A></LI><LI><A href="node17.html#section.problem.primitives">3.4 New Primitives</A></LI><LI><A href="node18.html#section.problem.watching">3.5 Watching Propagators</A></LI><LI><A href="node19.html#section.problem.safe">3.6 Example: Safe</A><UL class="toc"><LI><A href="node19.html#label52">Problem Specification</A></LI><LI><A href="node19.html#label53">Model and Distribution Strategy</A></LI><LI><A href="node19.html#label54">Script</A></LI></UL></LI></UL></LI><LI><A href="node20.html#chapter.elimination">4 Elimination of Symmetries and Defined Constraints</A><UL class="toc"><LI><A href="node21.html#section.elimination.grocery">4.1 Example: Grocery</A><UL class="toc"><LI><A href="node21.html#label55">Problem Specification</A></LI><LI><A href="node21.html#label56">Model</A></LI><LI><A href="node21.html#label57">Distribution Strategy</A></LI><LI><A href="node21.html#label58">Script</A></LI><LI><A href="node21.html#label59">A Subtle Symmetry</A></LI></UL></LI><LI><A href="node22.html#section.elimination.family">4.2 Example: Family</A><UL class="toc"><LI><A href="node22.html#label61">Problem Specification</A></LI><LI><A href="node22.html#label62">Model</A></LI><LI><A href="node22.html#label63">Distribution Stratgey</A></LI><LI><A href="node22.html#label64">Script</A></LI></UL></LI><LI><A href="node23.html#section.elimination.zebra">4.3 Example: Zebra Puzzle</A><UL class="toc"><LI><A href="node23.html#label67">Problem Specification</A></LI><LI><A href="node23.html#label68">Model</A></LI><LI><A href="node23.html#label69">Distribution Strategy</A></LI><LI><A href="node23.html#label70">Script</A></LI></UL></LI></UL></LI><LI><A href="node24.html#chapter.scripts">5 Parameterized Scripts</A><UL class="toc"><LI><A href="node25.html#section.scripts.queens">5.1 Example: Queens</A><UL class="toc"><LI><A href="node25.html#label71">Problem Specification</A></LI><LI><A href="node25.html#label72">Model</A></LI><LI><A href="node25.html#label73">Distribution Strategy</A></LI><LI><A href="node25.html#label74">Script</A></LI></UL></LI><LI><A href="node26.html#section.scripts.change">5.2 Example: Changing Money</A><UL class="toc"><LI><A href="node26.html#label75">Problem Specification</A></LI><LI><A href="node26.html#label76">Model</A></LI><LI><A href="node26.html#label77">Distribution Strategy</A></LI><LI><A href="node26.html#label78">Script</A></LI></UL></LI></UL></LI><LI><A href="node27.html#chapter.minimizing">6 Minimizing a Cost Function</A><UL class="toc"><LI><A href="node28.html#section.minimizing.mapcolor">6.1 Example: Coloring a Map</A><UL class="toc"><LI><A href="node28.html#label79">Problem Specification</A></LI><LI><A href="node28.html#label80">Model</A></LI><LI><A href="node28.html#label81">Distribution Strategy</A></LI><LI><A href="node28.html#label82">Script</A></LI></UL></LI><LI><A href="node29.html#section.minimizing.conference">6.2 Example: Conference</A><UL class="toc"><LI><A href="node29.html#label83">Problem Specification</A></LI><LI><A href="node29.html#label84">Model</A></LI><LI><A href="node29.html#label85">Distribution Strategy</A></LI><LI><A href="node29.html#label86">Script</A></LI></UL></LI></UL></LI><LI><A href="node30.html#chapter.propagators">7 Propagators for Redundant Constraints</A><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><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><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><LI><A href="node34.html#section.propagators.exercises">7.4 Exercises</A></LI></UL></LI><LI><A href="node35.html#chapter.reified">8 Reified Constraints</A><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><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><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><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></LI><LI><A href="node40.html#chapter.user-defined">9 User-Defined Distributors</A><UL class="toc"><LI><A href="node41.html#section.user-defined.naive">9.1 A Naive Distribution Strategy</A></LI><LI><A href="node42.html#section.user-defined.split">9.2 A Domain-Splitting Distributor</A></LI></UL></LI><LI><A href="node43.html#chapter.bab">10 Branch and Bound</A><UL class="toc"><LI><A href="node44.html#section.bab.align">10.1 Example: Aligning for a Photo, Revisited</A></LI><LI><A href="node45.html#section.bab.warehouses">10.2 Example: Locating Warehouses</A><UL class="toc"><LI><A href="node45.html#label122">Problem Specification</A></LI><LI><A href="node45.html#label123">Model</A></LI><LI><A href="node45.html#label124">Distribution Strategy</A></LI><LI><A href="node45.html#label126">Script</A></LI></UL></LI></UL></LI><LI><A href="node46.html#chapter.scheduling">11 Scheduling</A><UL class="toc"><LI><A href="node47.html#section.scheduling.house">11.1 Building a House</A><UL class="toc"><LI><A href="node47.html#label127">Problem Specification</A></LI><LI><A href="node47.html#sec.precedence">11.1.1 Building a House: Precedence Constraints</A><UL class="toc"><LI><A href="node47.html#label128">Model</A></LI><LI><A href="node47.html#label131">Distribution Strategy</A></LI><LI><A href="node47.html#label132">Script</A></LI></UL></LI><LI><A href="node47.html#sec.bahcc">11.1.2 Building a House: Capacity Constraints</A><UL class="toc"><LI><A href="node47.html#label136">Model</A></LI><LI><A href="node47.html#label140">Distribution Strategy</A></LI><LI><A href="node47.html#page.tasksonres">Script</A></LI></UL></LI><LI><A href="node47.html#sec.serializers">11.1.3 Building a House: Serializers</A><UL class="toc"><LI><A href="node47.html#label143">Ordering Tasks by Distribution</A></LI><LI><A href="node47.html#label145">Script</A></LI></UL></LI></UL></LI><LI><A href="node48.html#section.scheduling.bridge">11.2 Constructing a Bridge</A><UL class="toc"><LI><A href="node48.html#label147">Problem Specification</A></LI><LI><A href="node48.html#label148">Model</A></LI><LI><A href="node48.html#label149">Distribution Strategy</A></LI><LI><A href="node48.html#label150">Script</A></LI></UL></LI><LI><A href="node49.html#section.scheduling.edgefinding">11.3 Strong Propagators for Capacity Constraints </A></LI><LI><A href="node50.html#section.scheduling.strongser">11.4 Strong Serializers</A></LI><LI><A href="node51.html#section.scheduling.hard">11.5 Solving Hard Scheduling Problems</A><UL class="toc"><LI><A href="node51.html#label160">11.5.1 The Problem ABZ6</A></LI><LI><A href="node51.html#label162">11.5.2 The MT10 Problem</A></LI></UL></LI></UL></LI><LI><A href="node52.html#appendix.traps">A Traps and Pitfalls</A><UL class="toc"><LI><A href="node52.html#label163">Ordinary Arithmetic Blocks</A></LI><LI><A href="node52.html#label164">Delay of Propagators</A></LI><LI><A href="node52.html#label165">The Operators <CODE><SPAN class="keyword">=:</SPAN></CODE> and <CODE><SPAN class="keyword">::</SPAN></CODE> don't Introduce Pattern Variables</A></LI><LI><A href="node52.html#label166">Delay of Domain Specifications</A></LI><LI><A href="node52.html#label167">Coreferences are not Always Realized</A></LI><LI><A href="node52.html#label168">Large Numbers</A></LI></UL></LI><LI><A href="node53.html#appendix.golden-rules">B Golden Rules</A><UL class="toc"><LI><A href="node53.html#label169">Analyze and Understand your Script</A></LI><LI><A href="node53.html#label170">Experiment</A></LI><LI><A href="node53.html#label171">Have as much Constraint Propagation as Possible</A></LI><LI><A href="node53.html#label172">Find a Good Distribution Strategy</A></LI><LI><A href="node53.html#label173">Keep the Number of Variables and Propagators Low</A></LI><LI><A href="node53.html#label174">Eliminate Symmetries</A></LI><LI><A href="node53.html#label175">Introduce Propagators for Redundant Constraints</A></LI><LI><A href="node53.html#label176">Use Recomputation if Memory Consumption is a Problem</A></LI></UL></LI><LI><A href="node54.html#appendix.data">C Example Data</A><UL class="toc"><LI><A href="node54.html#section.data.scheduling">Scheduling</A></LI></UL></LI><LI><A href="answers.html#label182">Answers to the Exercises</A></LI><LI><A href="bib.html#label192">Bibliography</A></LI><LI><A href="idx.html#label193">Index</A></LI></UL><HR><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="index.html">- Up -</A></TD><TD><A href="node1.html#chapter.intro">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>
|