/usr/share/mozart/doc/system/node41.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.8 Reflection</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="node40.html#section.fs.iterating"><< Prev</A></TD><TD><A href="node33.html">- Up -</A></TD><TD><A href="node42.html#section.fs.distribution">Next >></A></TD></TR></TABLE><DIV id="section.fs.reflection"><H2><A name="section.fs.reflection">7.8 Reflection</A></H2><P>The result of a reflective procedure depends on the current state of the constraint store and is non-deterministic. </P><DL><DT><A name="label429"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>card</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>card <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>returns a description <I>Spec</I> of the current information on the cardinality of <I>M</I>. </P></DD><DT><A name="label431"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>lowerBound</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>lowerBound <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns a specification of the greatest lower bound that is currently known about the set <I>M</I>. </P></DD><DT><A name="label433"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>upperBound</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>upperBound <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns a specification of the least upper bound that is currently known about the set <I>M</I>. </P></DD><DT><A name="label435"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>unknown</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>unknown <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns a specification of the set of elements that are neither known to be included in <I>M</I> nor excluded from <I>M</I>. </P></DD><DT><A name="label437"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>lowerBoundList</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>lowerBoundList <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns an expanded specification (i. e., every individual element is represented) of the greatest lower bound that is currently known about the set <I>M</I>. </P></DD><DT><A name="label439"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>upperBoundList</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>upperBoundList <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns an expanded specification (i. e., every individual element is represented) of the least upper bound that is currently known about the set <I>M</I>. </P></DD><DT><A name="label441"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>unknownList</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>unknownList <SPAN class="keyword">*</SPAN>M ?Spec}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns an expanded specification (i. e., every individual element is represented) of the set of elements that are neither known to be included in <I>M</I> nor excluded from <I>M</I>. </P></DD><DT><A name="label443"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>lowerBound</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>lowerBound <SPAN class="keyword">*</SPAN>M ?I}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns the cardinality of the current greatest lower bound for <I>M</I>. </P></DD><DT><A name="label445"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>upperBound</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>upperBound <SPAN class="keyword">*</SPAN>M ?I}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns the cardinality of the current greatest lower bound for <I>M</I>. </P></DD><DT><A name="label447"></A> <CODE>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>unknown</CODE></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{FS<SPAN class="keyword">.</SPAN>reflect<SPAN class="keyword">.</SPAN>cardOf<SPAN class="keyword">.</SPAN>unknown <SPAN class="keyword">*</SPAN>M ?I}</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Returns the number of elements that are currently not known to be included or excluded from <I>M</I>. </P></DD></DL><P></P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node40.html#section.fs.iterating"><< Prev</A></TD><TD><A href="node33.html">- Up -</A></TD><TD><A href="node42.html#section.fs.distribution">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif Kornstaedt</A>, <A href="http://www.ps.uni-sb.de/~homik/">Martin Homik</A>, <A href="http://www.ps.uni-sb.de/~tmueller/">Tobias Müller</A>, <A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.info.ucl.ac.be/~pvr">Peter Van Roy</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|