Package org.jscience.computing.ai.planning

Interface Summary
Calculate This is the common interface for code calls in call terms.
PlannerTokenTypes DOCUMENT ME!
 

Class Summary
Axiom Each axiom at run time is represented as a class derived from this abstract class.
CompileTimeObject All the objects at compile time are instances of classes that are derived from this abstract class.
CompLess This class handles :sort-by logical preconditions that use numerical less than as the sorting function.
CompMore This class handles :sort-by logical preconditions that use numerical more than as the sorting function.
DelAddAtomic Each atomic element in the delete/add list of an operator both at compile time and run time is represented as an instance of this class.
DelAddElement Each element in the delete/add list of an operator both at compile time and run time is represented as an instance of a class derived from this abstract class.
DelAddForAll Each ForAll element in the delete/add list of an operator both at compile time and run time is represented as an instance of this class.
DelAddProtection Each Protection element in the delete/add list of an operator both at compile time and run time is represented as an instance of this class.
Domain Each domain at run time is represented as a class derived from this abstract class.
DomainElement This abstract class implements the basic common functionality of the all possible elements (i.e., methods, operators, and axioms) of a domain at run time.
InternalAxiom Each axiom at compile time is represented as an instance of this class.
InternalDomain Each domain at compile time is represented as an instance of this class.
InternalElement Each domain element (i.e., method, operator, or axiom) at compile time is represented as an instance of a class derived from this abstract class.
InternalMethod Each method at compile time is represented as an instance of this class.
InternalOperator Each operator at compile time is represented as an instance of this class.
List Each list, both at compile time and at run time, is an instance of this class.
LogicalExpression Each logical expression at compile time is represented as a class derived from this abstract class.
LogicalExpressionAssignment Each assign term in a logical expression at compile time is represented as an instance of this class.
LogicalExpressionAtomic Each atomic term in a logical expression at compile time is represented as an instance of this class.
LogicalExpressionCall Each call term in a logical expression at compile time is represented as an instance of this class.
LogicalExpressionConjunction Each conjunction at compile time is represented as an instance of this class.
LogicalExpressionDisjunction Each disjunction at compile time is represented as an instance of this class.
LogicalExpressionForAll Each ForAll logical expression at compile time is represented as an instance of this class.
LogicalExpressionNegation Each negative term in a logical expression at compile time is represented as an instance of this class.
LogicalExpressionNil Each empty logical expression at compile time is represented as an instance of this class.
LogicalPrecondition Each logical precondition at compile time is represented as an instance of this class.
Method Each method at run time is represented as a class derived from this abstract class.
MyIterator This class implements an iterator with data members that can keep track of where the algorithm is in terms of bindings found so far so that when the next binding is needed it can be calculated correctly.
NumberedPredicate This class represents a predicate with an integer number associated with it.
Operator Each operator at run time is represented as a class derived from this abstract class.
Plan This class represent a plan as a LinkedList of ground instances of operators.
Planner This class is the implementation of the Planner algorithm.
PlannerLexer DOCUMENT ME!
PlannerParser DOCUMENT ME!
Precondition This abstract class represents an iterator over all the possible bindings that can satisfy its corresponding logical expression at run time.
PreconditionAssign This class represents an iterator over all the possible bindings that can satisfy an assignment logical expression at run time.
PreconditionAtomic This class represents an iterator over all the possible bindings that can satisfy an atomic logical expression at run time.
PreconditionCall This class represents an iterator over all the possible bindings that can satisfy a call logical expression at run time.
PreconditionForAll This class represents an iterator over all the possible bindings that can satisfy a ForAll logical expression at run time.
PreconditionNegation This class represents an iterator over all the possible bindings that can satisfy a negation logical expression at run time.
PreconditionNil This class represents an iterator over all the possible bindings that can satisfy an empty logical expression at run time.
Predicate Each predicate, both at compile time and at run time, is an instance of this class.
SolverThread The thread that invokes Planner to solve a planning problem.
State This class is used to represent the current state of the world.
StdLib This class bundles all the code calls that are implemented in the standard library of Planner in one class.
TaskAtom Each task atom both at compile time and at run time is represented as an object of this class.
TaskList Each task list, both at compile time and at run time, is an instance of this class.
Term Each term, both at compile time and at run time, is an instance of a class derived from this abstract class.
TermCall Each call term, both at compile time and at run time, is an instance of this class.
TermConstant Each constant symbol, both at compile time and at run time, is an instance of this class.
TermList Each list both at compile time and at run time, is an instance of this class.
TermNumber Each numerical term both at compile time and at run time, is an instance of this class.
TermVariable Each variable symbol both at compile time and at run time, is an instance of this class.