<!--
  - Authors:
  -   Christian Schulte <schulte@ps.uni-sb.de>
  -
  - Copyright:
  -   Christian Schulte, 1998
  -
  - Last change:
  -   $Date$ by $Author$
  -   $Revision$
  -
  - This file is part of Mozart, an implementation
  - of Oz 3
  -    http://www.mozart-oz.org
  -
  - See the file "LICENSE" or
  -    http://www.mozart-oz.org/LICENSE.html
  - for information on usage and redistribution
  - of this file, and for a DISCLAIMER OF ALL
  - WARRANTIES.
  -
  -->

<chapter id="chapter.invoke">
  <Title/Invoking the Explorer/
      
  <P>
    The Explorer is provided as an object <<Explorer.object>>. The
    Explorer can be applied to a script as follows.
  </P>
      
  <P>
    <List>
      <Entry><<script>>
        <Index/<<Explorer>><AND><<object>><AND><<script>>/
      <Synopsis>
	<<<{Explorer.object script(?+{ScriptP})}>>>
	<<<{Explorer.object script(?+{ScriptP} ?+{OrderP})}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure). If the binary procedure <<?{OrderP}>> is
        given, the Explorer runs this script in branch and bound mode.
  
      <Entry><<one>>
        <Index/<<Explorer>><AND><<object>><AND><<one>>/
      <Synopsis>
	<<<{Explorer.object one(?+{ScriptP})}>>>
	<<<{Explorer.object one(?+{ScriptP} ?+{OrderP})}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure) and starts exploration of the search tree up
        to the first solution.  If the binary procedure <<?{OrderP}>>
        is given, the Explorer runs this script in branch and bound
        mode.

      <Entry><<all>>
        <Index/<<Explorer>><AND><<object>><AND><<all>>/
      <Synopsis>
	<<<{Explorer.object all(?+{ScriptP})}>>>
	<<<{Explorer.object all(?+{ScriptP} ?+{OrderP})}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure) and starts exploration of the entire search
        tree. If the binary procedure <<?{OrderP}>> is given, the
        Explorer runs this script in branch and bound mode.

    </List>
  </P>
      
  <P>
    The following procedures are provided for convenience.
  </P>
      
  <P>
    <List>
      <Entry><<one>>
        <Index/<<Explorer>><AND><<one>>/
      <Synopsis>
        <<<{Explorer.one ?+{ScriptP}}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure) and starts exploration of the search tree up
        to the first solution. 

      <Entry><<all>>
        <Index/<<Explorer>><AND><<all>>/
      <Synopsis>
	<<<{Explorer.all ?+{ScriptP}}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure) and starts exploration of the entire search
        tree. 

      <Entry><<best>>
        <Index/<<Explorer>><AND><<best>>/
      <Synopsis>
	<<<{Explorer.best ?+{ScriptP} ?+{OrderP}}>>>
      <Item>
        Initializes the Explorer with the script <<?{ScriptP}>> (a
        unary procedure) and starts exploration of the entire search
        tree following a branch and bound strategy. Best solution is
        performed with respect to <<?{OrderP}>> (a binary procedure).
	
    </List>
  </P>
      
</chapter>
    
    
