Index
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
A
- add(E) - Method in class edu.uky.ai.util.ImmutableList
-
Returns a new list with the given element added as the first element.
- add(Atom) - Method in class edu.uky.ai.logic.HashState
- add(Atom) - Method in interface edu.uky.ai.logic.MutableState
-
Makes a new atom true in this state.
- add(NodeInstance) - Method in class edu.uky.ai.planning.pg.Subgraph
-
Returns a new subgraph which contains a given node at a given level.
- add(Node, int) - Method in class edu.uky.ai.planning.pg.Subgraph
-
Returns a new subgraph which contains a given node at a given level.
- add(Object, Object) - Static method in class edu.uky.ai.util.Utilities
-
Adds two number objects together.
- add(T, T) - Method in class edu.uky.ai.util.DirectedAcyclicGraph
-
Returns a new DAG with a new edge from 'before' to 'after.' If either node does not exist, they will exist in the new DAG.
- addAverageColumn() - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional column whose cells contain the averages of each row.
- addAverageColumn(Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional column whose cells contain the averages of each row.
- addAverageRow() - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional row whose cells contain the averages of each column.
- addAverageRow(Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional row whose cells contain the averages of each column.
- addColumn(Object) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an addition column with the given label.
- addRow(Object) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an addition row with the given label.
- addStep(Step) - Method in class edu.uky.ai.planning.BackwardPlan
-
Returns a new plan with the given step added at the beginning.
- addStep(Step) - Method in class edu.uky.ai.planning.ForwardPlan
-
Returns a new plan with the given step added at the end.
- addTotalColumn() - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional column whose cells contain the totals of each row.
- addTotalColumn(Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional column whose cells contain the totals of each row.
- addTotalRow() - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional row whose cells contain the totals of each column.
- addTotalRow(Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table with an additional row whose cells contain the totals of each column.
- antecedent - Variable in class edu.uky.ai.logic.Implication
-
The first part of the implication
- argument - Variable in class edu.uky.ai.logic.NegatedAtom
-
The atom which this proposition negates
- argument - Variable in class edu.uky.ai.logic.Negation
-
The proposition this formula is the opposite of
- arguments - Variable in class edu.uky.ai.logic.BooleanProposition
-
The other propositions that are part of this Boolean proposition
- Arguments - Class in edu.uky.ai.util
-
A more convenient representation of command line argument based on keys and values.
- Arguments(String[]) - Constructor for class edu.uky.ai.util.Arguments
-
Constructs a new group of argument from an array of strings.
- argumentsEqual(Object) - Method in class edu.uky.ai.logic.BooleanProposition
-
Tests whether this formula's arguments are equal to the arguments of another Boolean proposition.
- ArrayIterable<E> - Class in edu.uky.ai.util
-
An object that allows an array to be treated as
Iterable
. - ArrayIterable(E[]) - Constructor for class edu.uky.ai.util.ArrayIterable
-
Constructs a new iterable for the given array.
- ArrayIterator<E> - Class in edu.uky.ai.util
-
Iterates through all the elements in an array.
- ArrayIterator(E[]) - Constructor for class edu.uky.ai.util.ArrayIterator
-
Constructs a new array iterator for a given array starting at a given index.
- ArrayIterator(E[], int) - Constructor for class edu.uky.ai.util.ArrayIterator
-
Constructs a new array iterator for a given array starting at a given index.
- asList() - Method in class edu.uky.ai.io.Node
-
Casts the node to a list.
- asList(int, int) - Method in class edu.uky.ai.io.Node
-
Casts the node to a list of a certain length.
- asLiterals(Proposition) - Static method in class edu.uky.ai.planning.Utilities
-
Since the precondition and effect of an action should be either a literal or a conjunction of literals, this utility method takes such a proposition and converts it into an
Iterable
. - asSymbol() - Method in class edu.uky.ai.io.Node
-
Casts this node to a symbol.
- asSymbol(String) - Method in class edu.uky.ai.io.Node
-
Casts this node to a specific symbol.
- Atom - Interface in edu.uky.ai.logic
-
An atom is the smallest indivisible unit of a logical language that has a truth value.
- AtomicProposition - Class in edu.uky.ai.logic
-
An individual statement that has a truth value (the atoms of propositional logic).
- AtomicProposition(String) - Constructor for class edu.uky.ai.logic.AtomicProposition
-
Constructs a new atom with the given name.
- average() - Method in class edu.uky.ai.util.Table.Sequence
-
Returns the average of the numeric elements of this sequence (non-numeric values are ignored).
- average(Function<Object, ?>) - Method in class edu.uky.ai.util.Table.Sequence
-
Returns the average of the numeric elements of this sequence (non-numeric values are ignored).
B
- BackwardHeuristic - Class in edu.uky.ai.planning.ss
-
A wrapper around a
StateSpaceHeuristic
which uses the given heuristic to estimate the distance from the problem's initial state to the current goal of abackward search
. - BackwardHeuristic(StateSpaceHeuristic) - Constructor for class edu.uky.ai.planning.ss.BackwardHeuristic
-
Constructs a new backward heuristic.
- BackwardNode - Class in edu.uky.ai.planning.ss
-
Represents a node in a backward state space search graph, where a node is a goal and a plan to achieve the problem goal if the node's goal can be achieved.
- BackwardPlan - Class in edu.uky.ai.planning
-
A totally ordered plan which is built from end (last step) to beginning.
- BackwardPlan() - Constructor for class edu.uky.ai.planning.BackwardPlan
-
Constructs a new plan with 0 steps.
- BackwardPlanner - Class in edu.uky.ai.planning.ss
-
A planner which searches backward through space of states for the solution to a given problem.
- BackwardPlanner(String) - Constructor for class edu.uky.ai.planning.ss.BackwardPlanner
-
Constructs a new backward state space planner with a given name.
- BackwardRoot - Class in edu.uky.ai.planning.ss
-
A special
BackwardNode
that represents the root of the backward search space and holds a pointer to the problem object and the search budget. - BackwardSearch - Class in edu.uky.ai.planning.ss
-
Represents a backward search through the space of states, starting at the problem goal and ending in the initial state.
- BackwardSearch(StateSpaceProblem, SearchBudget) - Constructor for class edu.uky.ai.planning.ss.BackwardSearch
-
Creates a backward state space search for a given problem.
- benchmark(Planner<?>[], Problem[], int, long, Writer) - Static method in class edu.uky.ai.planning.Main
-
Compares the performance of one or more planners on one or more problems.
- bindings - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
The binding constraints specifying which variables map to which values
- Bindings - Interface in edu.uky.ai.logic
-
A set of assignments of values to
Term
terms. - BooleanProposition - Class in edu.uky.ai.logic
-
The parent class of all Boolean expressions, whose truth value is defined by combining other expressions.
- BooleanProposition(ImmutableArray<Proposition>) - Constructor for class edu.uky.ai.logic.BooleanProposition
-
Constructs a new Boolean proposition with the given arguments.
- budget - Variable in class edu.uky.ai.planning.pg.SubgraphSpaceRoot
-
The search budget
- budget - Variable in class edu.uky.ai.planning.ps.PlanSpaceRoot
-
The search budget
- budget - Variable in class edu.uky.ai.planning.Search
-
The search budget for this problem
- budget - Variable in class edu.uky.ai.planning.ss.BackwardRoot
-
The search budget
- budget - Variable in class edu.uky.ai.planning.ss.ForwardRoot
-
The search budget
C
- CausalLink - Class in edu.uky.ai.planning.ps
-
A causal link describes how the effect of an earlier step (the tail) satisfied the precondition of a later step (the head).
- CausalLink(PartialStep, Literal, PartialStep) - Constructor for class edu.uky.ai.planning.ps.CausalLink
-
Constructs a new causal link with the given tail, label, and head.
- causalLinks - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
The causal links describing how step preconditions are satisfied
- cells - Variable in class edu.uky.ai.util.Table
-
The table's cells
- cells - Variable in class edu.uky.ai.util.Table.Sequence
-
The cells that make up this row or column
- checkTime() - Method in class edu.uky.ai.SearchBudget
-
When this method is called, it will throw an exception if the maximum amount of time has passed, otherwise it will do nothing.
- clone() - Method in class edu.uky.ai.io.Parser
- clone() - Method in class edu.uky.ai.logic.HashState
- clone() - Method in class edu.uky.ai.logic.HashSubstitution
- clone() - Method in class edu.uky.ai.util.Table
- close() - Method in class edu.uky.ai.io.DummyWriter
- column - Variable in class edu.uky.ai.util.Table.Cell
-
The column this cell belongs to
- columns - Variable in class edu.uky.ai.util.Table
-
The table's columns
- compareTo(Formula) - Method in interface edu.uky.ai.logic.Formula
- compareTo(Node) - Method in class edu.uky.ai.planning.pg.Node
- compareTo(NodeInstance) - Method in class edu.uky.ai.planning.pg.NodeInstance
- compareTo(Step) - Method in class edu.uky.ai.planning.Step
- Conjunction - Class in edu.uky.ai.logic
-
A conjunction, or logical AND statement, is true just when all of its arguments are true.
- Conjunction(Proposition...) - Constructor for class edu.uky.ai.logic.Conjunction
-
Constructs a conjunction from a group of arguments.
- Conjunction(ImmutableArray<Proposition>) - Constructor for class edu.uky.ai.logic.Conjunction
-
Constructs a conjunction from a group of arguments.
- Conjunction(Iterable<? extends Proposition>) - Constructor for class edu.uky.ai.logic.Conjunction
-
Constructs a conjunction from a group of arguments.
- CONJUNCTION_PREDICATE - Static variable in class edu.uky.ai.logic.Conjunction
-
The word used to express a conjunction
- consequent - Variable in class edu.uky.ai.logic.Implication
-
The second part of the implication, which is implied by the antecedent
- Constant - Class in edu.uky.ai.logic
-
A constant represents a specific unique thing.
- Constant(String, String) - Constructor for class edu.uky.ai.logic.Constant
-
Constructs a constant with the given type and name.
- constants - Variable in class edu.uky.ai.planning.Domain
-
A set of objects that must exist in for problems in this domain
- CONSTANTS_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a domain's constants
- consumers - Variable in class edu.uky.ai.planning.pg.LiteralNode
-
All step nodes which have this literal as a precondition
- contains(Atom) - Method in class edu.uky.ai.logic.HashState
- contains(Atom) - Method in interface edu.uky.ai.logic.State
-
Check whether or not an atom is true in this state.
- contains(Node, int) - Method in class edu.uky.ai.planning.pg.Subgraph
-
Tests whether this subgraph contains a given node at the given level.
- contains(Object) - Method in class edu.uky.ai.util.ImmutableArray
-
Checks if the array contains a given element.
- contains(Object) - Method in class edu.uky.ai.util.ImmutableList
-
Indicates whether or not the list contains a given element.
- containsKey(String) - Method in class edu.uky.ai.util.Arguments
-
Checks whether a given key is present in the arguments.
- countGenerated() - Method in class edu.uky.ai.planning.pg.PlanGraphSearch
- countGenerated() - Method in class edu.uky.ai.planning.pg.SubgraphSearch
- countGenerated() - Method in class edu.uky.ai.planning.ps.PlanSpaceSearch
- countGenerated() - Method in class edu.uky.ai.planning.Search
-
Returns the total number of nodes that have been generated in this search since it was created.
- countGenerated() - Method in class edu.uky.ai.planning.ss.BackwardSearch
- countGenerated() - Method in class edu.uky.ai.planning.ss.ForwardSearch
- countVisited() - Method in class edu.uky.ai.planning.pg.PlanGraphSearch
- countVisited() - Method in class edu.uky.ai.planning.pg.SubgraphSearch
- countVisited() - Method in class edu.uky.ai.planning.ps.PlanSpaceSearch
- countVisited() - Method in class edu.uky.ai.planning.Search
-
Returns the total number of nodes that have been visited in this search space since it was created.
- countVisited() - Method in class edu.uky.ai.planning.ss.BackwardSearch
- countVisited() - Method in class edu.uky.ai.planning.ss.ForwardSearch
D
- DEFAULT_TYPE - Static variable in class edu.uky.ai.logic.Term
-
The default type.
- DirectedAcyclicGraph<T> - Class in edu.uky.ai.util
-
A directed acyclic graph (or DAG) whose nodes are of a given type.
- DirectedAcyclicGraph() - Constructor for class edu.uky.ai.util.DirectedAcyclicGraph
-
Constructs a DAG with no nodes.
- DirectedEdge<T> - Class in edu.uky.ai.util
-
Represents a single directed egde in a
DirectedAcyclicGraph
. - Disjunction - Class in edu.uky.ai.logic
-
A disjunction, or logical OR statement, is true just when one or more of its arguments are true.
- Disjunction(Proposition...) - Constructor for class edu.uky.ai.logic.Disjunction
-
Constructs a disjunction from a group of arguments.
- Disjunction(ImmutableArray<Proposition>) - Constructor for class edu.uky.ai.logic.Disjunction
-
Constructs a disjunction from a group of arguments.
- Disjunction(Iterable<? extends Proposition>) - Constructor for class edu.uky.ai.logic.Disjunction
-
Constructs a disjunction from a group of arguments.
- DISJUNCTION_PREDICATE - Static variable in class edu.uky.ai.logic.Disjunction
-
The word used to express a disjunction
- divide(Object, Object) - Static method in class edu.uky.ai.util.Utilities
-
Divides the first number object by the second.
- domain - Variable in class edu.uky.ai.planning.Problem
-
The domain in which this problem exists
- Domain - Class in edu.uky.ai.planning
-
A planning domain is a reusable set of action templates called
Operator
s that describes all the ways the state of the world can change. - Domain(String, Constant[], Operator...) - Constructor for class edu.uky.ai.planning.Domain
-
Constructs a new domain.
- Domain(String, ImmutableArray<Constant>, ImmutableArray<Operator>) - Constructor for class edu.uky.ai.planning.Domain
-
Constructs a new domain.
- DOMAIN_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a domain
- DummyOutputStream - Class in edu.uky.ai.io
-
An implementation of
OutputStream
that does nothing. - DummyOutputStream() - Constructor for class edu.uky.ai.io.DummyOutputStream
- DummyWriter - Class in edu.uky.ai.io
-
An implementation of
Writer
that does nothing. - DummyWriter() - Constructor for class edu.uky.ai.io.DummyWriter
E
- edges() - Method in class edu.uky.ai.util.DirectedAcyclicGraph
-
Returns an
Iterable
of all the edges in this graph. - edu.uky.ai - package edu.uky.ai
-
Contains various Artificial Intelligence algorithms and testing environments.
- edu.uky.ai.io - package edu.uky.ai.io
-
Contains utilities for reading and writing AI problems and the algorithms that solve them.
- edu.uky.ai.logic - package edu.uky.ai.logic
-
Contains objects for representing logical formulas.
- edu.uky.ai.logic.io - package edu.uky.ai.logic.io
-
Contains parsers for various logical languages.
- edu.uky.ai.planning - package edu.uky.ai.planning
-
Contains objects for representing planning problems, planning algorithms, and plans.
- edu.uky.ai.planning.io - package edu.uky.ai.planning.io
-
Contains parsers for planning domains and problems.
- edu.uky.ai.planning.pg - package edu.uky.ai.planning.pg
-
Contains objects for representing plan graphs and planners that search for a solution by finding a valid subgraph of a plan graph.
- edu.uky.ai.planning.ps - package edu.uky.ai.planning.ps
-
Contains objects for representing plan space search and plan space planners.
- edu.uky.ai.planning.ss - package edu.uky.ai.planning.ss
-
Contains objects for representing forward and backward state space search and state space planners.
- edu.uky.ai.util - package edu.uky.ai.util
-
Contains assorted helpful objects.
- effect - Variable in class edu.uky.ai.planning.Operator
-
What becomes true after the action is taken
- effect - Variable in class edu.uky.ai.planning.Step
-
What becomes true after the step has been taken
- EFFECT_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify an operator's effect
- effects - Variable in class edu.uky.ai.planning.pg.StepNode
-
All literal nodes which become true after this step happens
- effects - Variable in class edu.uky.ai.planning.ps.PartialStep
-
An array of this step's effects
- elements - Variable in class edu.uky.ai.util.Tuple
-
The array of objects in the tuple
- EMPTY - Static variable in class edu.uky.ai.logic.ListBindings
-
An empty set of bindings
- equals(Formula, Substitution) - Method in interface edu.uky.ai.logic.Formula
-
Tests whether the formula represented by this object would be the same as another formula under the given substitution.
- equals(Object) - Method in class edu.uky.ai.logic.AtomicProposition
- equals(Object) - Method in class edu.uky.ai.logic.Conjunction
- equals(Object) - Method in class edu.uky.ai.logic.Disjunction
- equals(Object) - Method in class edu.uky.ai.logic.Implication
- equals(Object) - Method in class edu.uky.ai.logic.Negation
- equals(Object) - Method in class edu.uky.ai.logic.Predication
- equals(Object) - Method in class edu.uky.ai.logic.Term
- equals(Object) - Method in class edu.uky.ai.planning.pg.NodeInstance
- equals(Object) - Method in class edu.uky.ai.planning.pg.Subgraph
- equals(Object) - Method in class edu.uky.ai.planning.ps.CausalLink
- equals(Object) - Method in class edu.uky.ai.util.ImmutableArray
- equals(Object) - Method in class edu.uky.ai.util.ImmutableList
- equals(Object) - Method in class edu.uky.ai.util.Tuple
- evaluate(E) - Method in interface edu.uky.ai.planning.Heuristic
-
Returns an estimate of how much work remains to be done to convert the partial solution into a complete solution.
- evaluate(BackwardNode) - Method in class edu.uky.ai.planning.ss.BackwardHeuristic
- evaluate(ForwardNode) - Method in class edu.uky.ai.planning.ss.ForwardHeuristic
- evaluate(StateSpaceProblem, State, Proposition) - Method in interface edu.uky.ai.planning.ss.StateSpaceHeuristic
-
For a given problem, estimate the distance between the given state and the given goal proposition in number of steps.
- exists(int) - Method in class edu.uky.ai.planning.pg.Node
-
Tests whether or not this node exists at a given level.
- expand(Conjunction, Step) - Method in class edu.uky.ai.planning.ss.BackwardNode
-
Expands the child node that would be generated if the given step were the first one to be taken.
- expand(Subgraph) - Method in class edu.uky.ai.planning.pg.SubgraphSpaceNode
-
Creates a child subgraph space node (a node for which this node is the parent) with the given subgraph.
- expand(Step, State) - Method in class edu.uky.ai.planning.ss.ForwardNode
-
Expands the child node that would be generated by taking this step.
- expand(ImmutableList<PartialStep>, Bindings, DirectedAcyclicGraph<PartialStep>, ImmutableList<CausalLink>, ImmutableList<Flaw>) - Method in class edu.uky.ai.planning.ps.PlanSpaceNode
-
Creates a child partial plan node (a node for this this node is the parent) with the given steps, bindings, orderings, causal links, and flaws.
- extend() - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Adds one new level to the graph.
F
- FALSE - Static variable in interface edu.uky.ai.logic.Proposition
-
A proposition which is always trivially false
- findSubgraph() - Method in class edu.uky.ai.planning.pg.SubgraphSearch
-
Searches the space of
SubgraphSpaceNode
s until a node which represents a solution is found. - first - Variable in class edu.uky.ai.io.List
-
The first elerment in this list
- first - Variable in class edu.uky.ai.planning.pg.Subgraph
-
The first node (and the level at which it appears) in the subgraph
- first - Variable in class edu.uky.ai.util.ImmutableList
-
The first (most recently added) element in the list
- Flaw - Class in edu.uky.ai.planning.ps
-
A flaw is something that prevents a partial plan from being a solution to its problem.
- Flaw() - Constructor for class edu.uky.ai.planning.ps.Flaw
- flaws - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
A list of flaws (if any) that prevent this plan from being a solution
- flush() - Method in class edu.uky.ai.io.DummyWriter
- forEach(Consumer<? super E>) - Method in class edu.uky.ai.util.ImmutableArray
- forEachLiteral(Proposition, Consumer<? super Literal>) - Static method in class edu.uky.ai.planning.Utilities
-
Since the precondition and effect of an action should be either a literal or a conjunction of literals, this utility method takes such a proposition and feeds each of its literals to a
Consumer
. - FormatException - Exception in edu.uky.ai.io
-
A format exception is thrown when the input to a
Parser
is improperly formatted. - FormatException(String) - Constructor for exception edu.uky.ai.io.FormatException
-
Constructs a new format exception with the given message.
- Formula - Interface in edu.uky.ai.logic
-
The parent class of all logical formulas.
- ForwardHeuristic - Class in edu.uky.ai.planning.ss
-
A wrapper around a
StateSpaceHeuristic
which uses the given heuristic to estimate the distance from the current state in aforward search
to the problem's goal. - ForwardHeuristic(StateSpaceHeuristic) - Constructor for class edu.uky.ai.planning.ss.ForwardHeuristic
-
Constructs a new forward heuristic.
- ForwardNode - Class in edu.uky.ai.planning.ss
-
Represents a node in a forward state space search graph, where a node is a state and the plan taken to reach that state from the initial state.
- ForwardPlan - Class in edu.uky.ai.planning
-
A totally ordered plan which is built from beginning (first step) to end last step).
- ForwardPlan() - Constructor for class edu.uky.ai.planning.ForwardPlan
-
Constructs a new plan with 0 steps.
- ForwardPlanner - Class in edu.uky.ai.planning.ss
-
A planner which searches forward through space of states for the solution to a given problem.
- ForwardPlanner(String) - Constructor for class edu.uky.ai.planning.ss.ForwardPlanner
-
Constructs a new forward state space planner with a given name.
- ForwardRoot - Class in edu.uky.ai.planning.ss
-
A special
ForwardNode
that represents the root of the forward search space and holds a pointer to the problem object and the search budget. - ForwardSearch - Class in edu.uky.ai.planning.ss
-
Represents a forward search through the space of states, starting at the initial state and ending in any state where the goal is achieved.
- ForwardSearch(StateSpaceProblem, SearchBudget) - Constructor for class edu.uky.ai.planning.ss.ForwardSearch
-
Creates a forward state space search for a given problem.
G
- generated - Variable in class edu.uky.ai.planning.Result
-
The number of nodes generated during the search
- get(int) - Method in class edu.uky.ai.util.ImmutableArray
-
Returns the element at a given index.
- get(Formula) - Method in class edu.uky.ai.logic.HashSubstitution
- get(Formula) - Method in class edu.uky.ai.logic.ListBindings
- get(Formula) - Method in interface edu.uky.ai.logic.Substitution
-
Defines what a given formula should be replaced with.
- get(Literal) - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Returns a literal object's node in this graph.
- get(Step) - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Returns a step object's node in this graph.
- getBudget() - Method in class edu.uky.ai.planning.ss.BackwardRoot
- getBudget() - Method in class edu.uky.ai.planning.ss.ForwardRoot
- getBudget() - Method in interface edu.uky.ai.planning.ss.StateSpaceRoot
-
The search budget for solving this problem.
- getCell(Object, Object) - Method in class edu.uky.ai.util.Table
-
Returns the cell at the interaction of the row with the given label and and the column with the given label
- getColumn(Object) - Method in class edu.uky.ai.util.Table
-
Returns the column with the given label.
- getComponentType() - Method in class edu.uky.ai.util.ImmutableArray
-
Returns the array's component type.
- getConsumers(int) - Method in class edu.uky.ai.planning.pg.LiteralNode
-
Returns all steps at the next level of the plan graph which have this literal as a precondition.
- getDefined(String, Class<E>) - Method in class edu.uky.ai.io.Parser
-
Returns the most recently defined object whose names matches the given name and which is of a given type.
- getEffects(int) - Method in class edu.uky.ai.planning.pg.StepNode
-
Returns all literals at a given level of the plan graph which are effects of this step.
- getFileName(File) - Static method in class edu.uky.ai.util.Utilities
-
Returns the name of a file (with no preceding URL information and no trailing file extensions).
- getLevel() - Method in class edu.uky.ai.planning.pg.Node
-
Returns the index of the earliest level at which this node appears, or -1 if this node has not yet appeared at any level.
- getLevel(int) - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Returns a
level
object for the level of the given index. - getObjectsByType(String) - Method in class edu.uky.ai.planning.Problem
-
Returns all the objects in the world which are of a given type.
- getOperations() - Method in class edu.uky.ai.SearchBudget
-
Returns the number of operations executed so far.
- getParser(Class<E>) - Method in class edu.uky.ai.io.Parser
-
Returns the @{link ObjectParser} responsible for parsing objects of the given type.
- getPlan() - Method in class edu.uky.ai.planning.pg.Subgraph
-
Converts the step nodes in this subgraph into a plan.
- getPlan() - Method in class edu.uky.ai.planning.ss.BackwardNode
- getPlan() - Method in class edu.uky.ai.planning.ss.ForwardNode
- getPlan() - Method in interface edu.uky.ai.planning.ss.StateSpaceNode
-
Returns the plan this node represents.
- getPreconditions(int) - Method in class edu.uky.ai.planning.pg.StepNode
-
Returns all literals at the previous level of the plan graph which are preconditions of this step.
- getProblem() - Method in class edu.uky.ai.planning.ss.BackwardRoot
- getProblem() - Method in class edu.uky.ai.planning.ss.ForwardRoot
- getProblem() - Method in interface edu.uky.ai.planning.ss.StateSpaceRoot
-
Returns the state space problem being solved.
- getProducers(int) - Method in class edu.uky.ai.planning.pg.LiteralNode
-
Returns all steps at a given level of the plan graph which have this literal as an effect.
- getRemainingOperations() - Method in class edu.uky.ai.SearchBudget
-
Returns the number of operations that may still be executed.
- getRemainingTime() - Method in class edu.uky.ai.SearchBudget
-
Returns the amount of time remaining before time is up.
- getRoot() - Method in class edu.uky.ai.planning.pg.SubgraphSpaceNode
-
Returns the root node of this search space.
- getRoot() - Method in class edu.uky.ai.planning.ps.PlanSpaceNode
-
Returns to
root node
of this search space. - getRoot() - Method in class edu.uky.ai.planning.ss.BackwardNode
- getRoot() - Method in class edu.uky.ai.planning.ss.ForwardNode
- getRoot() - Method in interface edu.uky.ai.planning.ss.StateSpaceNode
-
Returns the root node of the search space.
- getRow(Object) - Method in class edu.uky.ai.util.Table
-
Returns the row with the given label.
- getTime() - Method in class edu.uky.ai.SearchBudget
-
Returns the amount of time spent so far.
- getValue(String) - Method in class edu.uky.ai.util.Arguments
-
Returns the value immediately after a given key.
- getValues(String) - Method in class edu.uky.ai.util.Arguments
-
Returns the values (0, 1, or many) immediately after a given key.
- goal - Variable in class edu.uky.ai.planning.Problem
-
Some goal that needs to be achieved by any solution to this problem
- goal - Variable in class edu.uky.ai.planning.ss.BackwardNode
-
The goal to be achieve that will allow the plan to succeed
- GOAL_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a problem's goal
- goalAchieved() - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Tests whether all the problem's goal literals exist at the highest level of the graph.
- goals - Variable in class edu.uky.ai.planning.pg.PlanGraph
-
The literal nodes for the problem's goals
- graph - Variable in class edu.uky.ai.planning.pg.Level
-
The graph to which this level belongs
- graph - Variable in class edu.uky.ai.planning.pg.Node
-
The graph to which this node belongs
- graph - Variable in class edu.uky.ai.planning.pg.SubgraphSpaceRoot
-
The plan graph being searched
- groups - Variable in class edu.uky.ai.util.Arguments
-
Arguments, divided into groups.
H
- hasBeenExhausted() - Method in class edu.uky.ai.SearchBudget
-
Returns true if there are no more operations or time remaining.
- hashCode() - Method in class edu.uky.ai.logic.AtomicProposition
- hashCode() - Method in class edu.uky.ai.logic.Conjunction
- hashCode() - Method in class edu.uky.ai.logic.Disjunction
- hashCode() - Method in class edu.uky.ai.logic.Implication
- hashCode() - Method in class edu.uky.ai.logic.Negation
- hashCode() - Method in class edu.uky.ai.logic.Predication
- hashCode() - Method in class edu.uky.ai.logic.Term
- hashCode() - Method in class edu.uky.ai.planning.Domain
- hashCode() - Method in class edu.uky.ai.planning.pg.LiteralNode
- hashCode() - Method in class edu.uky.ai.planning.pg.NodeInstance
- hashCode() - Method in class edu.uky.ai.planning.pg.StepNode
- hashCode() - Method in class edu.uky.ai.planning.pg.Subgraph
- hashCode() - Method in class edu.uky.ai.planning.Problem
- hashCode() - Method in class edu.uky.ai.planning.ps.CausalLink
- hashCode() - Method in class edu.uky.ai.util.ImmutableArray
- hashCode() - Method in class edu.uky.ai.util.ImmutableList
- hashCode() - Method in class edu.uky.ai.util.Table.Cell
- hashCode() - Method in class edu.uky.ai.util.Table.Sequence
- hashCode() - Method in class edu.uky.ai.util.Tuple
- HashState - Class in edu.uky.ai.logic
-
An implementation of
MutableState
that uses aHashMap
to keep track of which atoms are true. - HashState() - Constructor for class edu.uky.ai.logic.HashState
-
Constructs a new state in which no atoms are true.
- HashState(HashState) - Constructor for class edu.uky.ai.logic.HashState
-
Constructs a new state which has exactly the same true atoms as a given
HashState
. - HashState(State) - Constructor for class edu.uky.ai.logic.HashState
-
Constructs a new state which has exactly the same true atoms as a given
State
. - HashSubstitution - Class in edu.uky.ai.logic
-
A substitution which uses a
HashMap
to keep track of substitutions. - HashSubstitution() - Constructor for class edu.uky.ai.logic.HashSubstitution
-
Constructs a new, empty hash substitution.
- HashSubstitution(HashSubstitution) - Constructor for class edu.uky.ai.logic.HashSubstitution
-
Constructs a new hash substitution which is a clone of the given substitution.
- hasLeveledOff() - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Tests whether or not the graph has leveled off (meaning that no new literals or steps will appear if a new level is added).
- hasNext() - Method in class edu.uky.ai.util.ArrayIterator
- head - Variable in class edu.uky.ai.planning.ps.CausalLink
-
The later step
- head - Variable in class edu.uky.ai.util.DirectedEdge
-
The second of 'after' object
- heuristic - Variable in class edu.uky.ai.planning.ss.BackwardHeuristic
-
The heuristic to use
- heuristic - Variable in class edu.uky.ai.planning.ss.ForwardHeuristic
-
The heuristic to use
- Heuristic<E> - Interface in edu.uky.ai.planning
-
A heuristic is a function which estimates how much work remains to be done to convert a partial solution to a problem into a complete solution.
I
- ImmutableArray<E> - Class in edu.uky.ai.util
-
An array whose values cannot be modified.
- ImmutableArray(E[]) - Constructor for class edu.uky.ai.util.ImmutableArray
-
Constructs a new immutable array which reflects the given array.
- ImmutableArray(Collection<E>, Class<E>) - Constructor for class edu.uky.ai.util.ImmutableArray
-
Creates an immutable array that contains the elements of a collection.
- ImmutableList<E> - Class in edu.uky.ai.util
-
A list of objects which cannot be modified.
- ImmutableList() - Constructor for class edu.uky.ai.util.ImmutableList
-
Constructs a new, empty immutable list.
- ImmutableList(E, ImmutableList<E>) - Constructor for class edu.uky.ai.util.ImmutableList
-
Constructs a new immutable list with a given first element and a given rest of the list.
- Implication - Class in edu.uky.ai.logic
-
An implication, or logical IF statement, is defined by the truth value of its two parts, the antecedent and the consequent.
- Implication(Proposition, Proposition) - Constructor for class edu.uky.ai.logic.Implication
-
Constructs an implication from a given antecedent and consequent.
- IMPLICATION_PREDICATE - Static variable in class edu.uky.ai.logic.Implication
-
The word used to express an implication
- incrementLiteralCount() - Method in class edu.uky.ai.planning.pg.StepNode
-
Notifies this step that one of its preconditions has been met.
- incrementOperations() - Method in class edu.uky.ai.SearchBudget
-
This method is called to signal that one operations has been performed.
- indexOf(Object) - Method in class edu.uky.ai.util.ImmutableArray
-
Returns the index of the first object that is equal to a given object.
- INFINITE - Static variable in class edu.uky.ai.SearchBudget
-
A search budget with no limitations
- INFINITE_OPERATIONS - Static variable in class edu.uky.ai.SearchBudget
-
Represents no limit on the number of operations
- INFINITE_TIME - Static variable in class edu.uky.ai.SearchBudget
-
Represents no limit on the amount of time
- initial - Variable in class edu.uky.ai.planning.Problem
-
The initial state of the world, which specifies the disposition of every object
- INITIAL_STATE_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a problem's initial state
- initialize(State) - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Resets the graph to have only level 0, which will include exactly those literals which are true in the given state.
- isEmpty() - Method in class edu.uky.ai.util.MinPriorityQueue
-
Tests whether this queue is empty.
- isGround() - Method in class edu.uky.ai.logic.AtomicProposition
- isGround() - Method in class edu.uky.ai.logic.BooleanProposition
- isGround() - Method in class edu.uky.ai.logic.Constant
- isGround() - Method in interface edu.uky.ai.logic.Formula
-
Checks whether this formula contains any variables.
- isGround() - Method in class edu.uky.ai.logic.Predication
- isGround() - Method in class edu.uky.ai.logic.Variable
- isInfinite() - Method in class edu.uky.ai.SearchBudget
-
Returns whether or not it is possible for this budget to run out.
- isList() - Method in class edu.uky.ai.io.Node
-
Tests if this node is a
List
. - isList(int, int) - Method in class edu.uky.ai.io.Node
-
Tests if this node is a
List
of a certain length. - isSolution(Plan) - Method in class edu.uky.ai.planning.Problem
-
Checks if a given plan is a solution to this problem.
- isSymbol() - Method in class edu.uky.ai.io.Node
-
Tests if this node is a
Symbol
. - isSymbol(String) - Method in class edu.uky.ai.io.Node
-
Tests if this node is a specific
Symbol
. - isTrue(State) - Method in interface edu.uky.ai.logic.Atom
- isTrue(State) - Method in class edu.uky.ai.logic.Conjunction
- isTrue(State) - Method in class edu.uky.ai.logic.Disjunction
- isTrue(State) - Method in class edu.uky.ai.logic.Implication
- isTrue(State) - Method in class edu.uky.ai.logic.Negation
- isTrue(State) - Method in interface edu.uky.ai.logic.Proposition
-
Tests whether this proposition is true in the given state.
- iterator() - Method in class edu.uky.ai.logic.HashState
- iterator() - Method in class edu.uky.ai.planning.BackwardPlan
- iterator() - Method in class edu.uky.ai.planning.ForwardPlan
- iterator() - Method in class edu.uky.ai.planning.pg.Subgraph
- iterator() - Method in class edu.uky.ai.util.ArrayIterable
- iterator() - Method in class edu.uky.ai.util.DirectedAcyclicGraph
- iterator() - Method in class edu.uky.ai.util.ImmutableArray
- iterator() - Method in class edu.uky.ai.util.ImmutableList
- iterator() - Method in class edu.uky.ai.util.Table.Sequence
L
- label - Variable in class edu.uky.ai.planning.ps.CausalLink
-
The fact that is an effect of the tail and a precondition of the head
- label - Variable in class edu.uky.ai.util.Table.Sequence
-
The row or column lable of this sequence
- length - Variable in class edu.uky.ai.io.List
-
The number of elements in this list
- level - Variable in class edu.uky.ai.planning.pg.Node
-
The index of the level at which this node first appears, or -1 if it has not yet appeared
- level - Variable in class edu.uky.ai.planning.pg.NodeInstance
-
The level at which this node appears
- Level - Class in edu.uky.ai.planning.pg
-
Represents a specific level of a
PlanGraph
, and contains only those nodes which exist at this level. - Level(PlanGraph, int) - Constructor for class edu.uky.ai.planning.pg.Level
-
Constructs a new level object.
- link - Variable in class edu.uky.ai.planning.ps.ThreatenedCausalLinkFlaw
-
The threatened causal link
- List - Class in edu.uky.ai.io
-
A list is a collection of 0 to many nodes.
- ListBindings - Class in edu.uky.ai.logic
-
An implementation of
Bindings
based on a linked list. - literal - Variable in class edu.uky.ai.planning.pg.LiteralNode
-
The literal represented by this node
- Literal - Interface in edu.uky.ai.logic
-
A literal is an
Atom
or anegated atom
. - literalMap - Variable in class edu.uky.ai.planning.pg.PlanGraph
-
A mapping of literal objects to their corresponding nodes
- LiteralNode - Class in edu.uky.ai.planning.pg
-
Represents a unique literal, or fact, in a plan graph.
- LiteralNode(PlanGraph, Literal) - Constructor for class edu.uky.ai.planning.pg.LiteralNode
-
Constructs a new literal node for the given literal in the given plan graph.
- literals - Variable in class edu.uky.ai.planning.pg.Level
-
All literal nodes which exist at this level.
- literals - Variable in class edu.uky.ai.planning.ss.StateSpaceProblem
-
Every possible literal that could be true or false in a given state
- loadFromJARFile(Class<T>, File) - Static method in class edu.uky.ai.util.Utilities
-
Searches a given JAR file for the definition of a non-abstract class that extends the given class and returns a new instance of that class.
- log2(double) - Static method in class edu.uky.ai.util.Utilities
-
Calculates the base 2 logarithm of a number.
- LogicParser - Class in edu.uky.ai.logic.io
-
Contains common parsing rules that apply to many kinds of logic.
- LogicParser() - Constructor for class edu.uky.ai.logic.io.LogicParser
-
Constructs a new parser.
M
- main(String[]) - Static method in class edu.uky.ai.planning.Main
-
Launches the planning application according to its command line arguments.
- Main - Class in edu.uky.ai.planning
-
The entry point for the planning application.
- Main() - Constructor for class edu.uky.ai.planning.Main
- MAJOR_VERSION - Static variable in class edu.uky.ai.Settings
-
Major version number
- makeBackwardSearch(StateSpaceProblem, SearchBudget) - Method in class edu.uky.ai.planning.ss.BackwardPlanner
-
Given some state space problem to be solved, this method constructs the appropriate kind of
BackwardSearch
to solve it based on this planner. - makeForwardSearch(StateSpaceProblem, SearchBudget) - Method in class edu.uky.ai.planning.ss.ForwardPlanner
-
Given some state space problem to be solved, this method constructs the appropriate kind of
ForwardSearch
to solve it based on this planner. - makeSearch(PlanGraph, SearchBudget) - Method in class edu.uky.ai.planning.pg.PlanGraphPlanner
-
Creates a
SubgraphSearch
for the second phase of the planner's search process. - makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.pg.PlanGraphPlanner
- makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.Planner
-
Given some problem to be solved, and search budget in which to solve it, this method constructs the appropriate kind of
Search
to solve the problem based on this planner's technique. - makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.ps.PlanSpacePlanner
- makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.ss.BackwardPlanner
- makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.ss.ForwardPlanner
- makeSearch(Problem, SearchBudget) - Method in class edu.uky.ai.planning.ss.StateSpacePlanner
- makeStateSpaceSearch(StateSpaceProblem, SearchBudget) - Method in class edu.uky.ai.planning.ss.BackwardPlanner
- makeStateSpaceSearch(StateSpaceProblem, SearchBudget) - Method in class edu.uky.ai.planning.ss.ForwardPlanner
- makeStateSpaceSearch(StateSpaceProblem, SearchBudget) - Method in class edu.uky.ai.planning.ss.StateSpacePlanner
-
Given some state space problem to be solved, this method constructs the appropriate kind of
StateSpaceSearch
to solve it based on this planner. - makeStep(Substitution) - Method in class edu.uky.ai.planning.Operator
-
Creates a ground step (i.e.
- makeStep(Substitution) - Method in class edu.uky.ai.planning.ps.PartialStep
-
Given a substitution that specific values for all of this step's parameters, this method will return the
Step
object that this object represents. - makeTrue(MutableState) - Method in interface edu.uky.ai.logic.Atom
- makeTrue(MutableState) - Method in class edu.uky.ai.logic.Conjunction
- makeTrue(MutableState) - Method in class edu.uky.ai.logic.Disjunction
- makeTrue(MutableState) - Method in class edu.uky.ai.logic.Implication
- makeTrue(MutableState) - Method in class edu.uky.ai.logic.NegatedAtom
- makeTrue(MutableState) - Method in class edu.uky.ai.logic.Negation
- makeTrue(MutableState) - Method in interface edu.uky.ai.logic.Proposition
-
Modifies the given state object to make this proposition true.
- makeUnique() - Method in class edu.uky.ai.logic.Variable
-
Returns a new variable object with the same type and a name which is similar to this variable's name but guaranteed to be unique (i.e.
- markForReset() - Method in class edu.uky.ai.planning.pg.Node
-
Marks this node as needing to be reset when the plan graph is reset.
- MINOR_VERSION - Static variable in class edu.uky.ai.Settings
-
Minor version number
- MinPriorityQueue<T> - Class in edu.uky.ai.util
-
A min priority queue which, instead of using a
Comparator
, allows the user to specify a numeric key that should be associated with the item being added to the queue. - MinPriorityQueue() - Constructor for class edu.uky.ai.util.MinPriorityQueue
-
Constructs a new, empty min priority queue.
- multiply(Object, Object) - Static method in class edu.uky.ai.util.Utilities
-
Multiplies two number objects together.
- MutableState - Interface in edu.uky.ai.logic
-
A state which can be modified.
- mutex(Node, int) - Method in class edu.uky.ai.planning.pg.Node
-
Tests whether or not this node is mutually exclusive with another given node at the given level.
N
- name - Variable in class edu.uky.ai.logic.AtomicProposition
-
The proposition's name
- name - Variable in class edu.uky.ai.logic.Term
-
The thing's name
- name - Variable in class edu.uky.ai.planning.Domain
-
The name of the domain
- name - Variable in class edu.uky.ai.planning.Operator
-
The name of the action
- name - Variable in class edu.uky.ai.planning.Planner
-
The name of the planner
- name - Variable in class edu.uky.ai.planning.Problem
-
The name of the problem
- name - Variable in class edu.uky.ai.planning.Step
-
The name of the step
- negate() - Method in interface edu.uky.ai.logic.Atom
- negate() - Method in class edu.uky.ai.logic.Conjunction
- negate() - Method in class edu.uky.ai.logic.Disjunction
- negate() - Method in class edu.uky.ai.logic.Implication
- negate() - Method in interface edu.uky.ai.logic.Literal
- negate() - Method in class edu.uky.ai.logic.NegatedAtom
- negate() - Method in class edu.uky.ai.logic.Negation
- negate() - Method in interface edu.uky.ai.logic.Proposition
-
Returns a proposition whose truth values are opposite of this proposition (i.e.
- negateArguments() - Method in class edu.uky.ai.logic.BooleanProposition
-
Returns the arguments of this formula after negating each of them.
- NegatedAtom - Class in edu.uky.ai.logic
- NegatedAtom(Atom) - Constructor for class edu.uky.ai.logic.NegatedAtom
-
Constructs a new negated atom with a given atom.
- Negation - Class in edu.uky.ai.logic
-
Represents the negation (or opposite) of a proposition.
- Negation(Proposition) - Constructor for class edu.uky.ai.logic.Negation
-
Constructs a new negation with the given proposition.
- NEGATION_PREDICATE - Static variable in class edu.uky.ai.logic.Negation
-
The word used to express a negation
- next - Variable in class edu.uky.ai.io.Node
-
The node that follows this node (i.e.
- next() - Method in class edu.uky.ai.util.ArrayIterator
- node - Variable in class edu.uky.ai.planning.pg.NodeInstance
-
The plan graph node
- Node - Class in edu.uky.ai.io
- Node - Class in edu.uky.ai.planning.pg
-
The abstract superclass of
LiteralNode
andStepNode
. - Node(PlanGraph) - Constructor for class edu.uky.ai.planning.pg.Node
-
Constructs a new node object in the given plan graph.
- NodeInstance - Class in edu.uky.ai.planning.pg
-
Represents a plan graph node at a specific level.
- NodeInstance(Node, int) - Constructor for class edu.uky.ai.planning.pg.NodeInstance
-
Constructs a new node instance for the given node and level.
- number - Variable in class edu.uky.ai.planning.pg.Level
-
The index of this level
- number - Variable in class edu.uky.ai.util.Table.Sequence
-
The row or column number of this sequence
O
- ObjectParser<E> - Interface in edu.uky.ai.io
-
An object parser provides a means of translating a node into an object of a specific kind.
- objects - Variable in class edu.uky.ai.planning.Problem
-
All the objects that exist in the world
- OBJECTS_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a problem's objects
- OpenPreconditionFlaw - Class in edu.uky.ai.planning.ps
-
An open precondition flaw indicates that a partial plan has not yet guaranteed that some precondition of some step will be satisfied.
- OpenPreconditionFlaw(PartialStep, Literal) - Constructor for class edu.uky.ai.planning.ps.OpenPreconditionFlaw
-
Constructs a new open precondition flaw for a given step and precondition.
- OPERATIONS_LIMIT - Static variable in class edu.uky.ai.planning.Settings
-
The default maximum number of nodes that a planner may expand when solving a problem
- OperationsBudgetExceededException - Exception in edu.uky.ai
-
Indicates that an algorithm has performed more than the maximum allowed number of operations.
- operator - Variable in class edu.uky.ai.planning.ps.PartialStep
-
The operator of which this step is an instance (or null if this step is not an instance of any operator)
- Operator - Class in edu.uky.ai.planning
-
An operator is an action template that describes one way to change the world in terms of its precondition (what must be true before the action can be taken) and effect (what becomes true after the action is taken).
- Operator(String, Variable[], Proposition, Proposition) - Constructor for class edu.uky.ai.planning.Operator
-
Constructs a new action template.
- Operator(String, ImmutableArray<Variable>, Proposition, Proposition) - Constructor for class edu.uky.ai.planning.Operator
-
Constructs a new action template.
- OPERATOR_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify an operator
- operators - Variable in class edu.uky.ai.planning.Domain
-
A set of action templates
- orderings - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
The constraints on how steps are ordered
P
- parameters - Variable in class edu.uky.ai.planning.Operator
-
The parameters that provide the specific details for the action
- parameters - Variable in class edu.uky.ai.planning.ps.PartialStep
-
All the variables used in this step
- PARAMETERS_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify an operator's parameters
- parent - Variable in class edu.uky.ai.planning.pg.SubgraphSpaceNode
-
This node's parent
- parent - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
This node's parent (the node of which this node is a refinement)
- parent - Variable in class edu.uky.ai.planning.ss.BackwardNode
-
This node's parent node (i.e.
- parent - Variable in class edu.uky.ai.planning.ss.ForwardNode
-
This node's parent node (i.e.
- parse(Node, Parser) - Method in interface edu.uky.ai.io.ObjectParser
-
Converts the given node into an object of type E.
- parse(Node, Class<? extends E>, Class<? extends E>...) - Method in class edu.uky.ai.io.Parser
-
Parses a given
Node
according to the rules defined by this parser and returns the object created. - parse(File) - Static method in class edu.uky.ai.io.Node
-
Parse a given file as a node.
- parse(File, Class<? extends E>) - Method in class edu.uky.ai.io.Parser
-
Parses a given file according to the rules defined by this parser and returns the object created.
- parse(String) - Static method in class edu.uky.ai.io.Node
-
Parse a given string as a node.
- parse(String, Class<? extends E>) - Method in class edu.uky.ai.io.Parser
-
Parses a given string according to the rules defined by this parser and returns the object created.
- Parser - Class in edu.uky.ai.io
-
Converts text into various kinds of objects based on customizable rules.
- Parser() - Constructor for class edu.uky.ai.io.Parser
-
Constructs a new parser with no rules or defined objects.
- Parser(Parser) - Constructor for class edu.uky.ai.io.Parser
-
Constructs a new parser that is a clone of the given parser.
- Partial - Interface in edu.uky.ai.planning.ps
-
This interface is implemented by any object which is affected by the bindings of a least-commitment plan.
- PartialStep - Class in edu.uky.ai.planning.ps
-
This class represents a step in a partial plan.
- PartialStep(Operator) - Constructor for class edu.uky.ai.planning.ps.PartialStep
-
Constructs a partial step from an
Operator
(a step template). - path(T, T) - Method in class edu.uky.ai.util.DirectedAcyclicGraph
-
Checks whether or not a path exists from one node to another in this DAG.
- peek() - Method in class edu.uky.ai.util.MinPriorityQueue
-
Returns, but does not remove, the object with the lowest key value (i.e.
- percent(double) - Static method in class edu.uky.ai.util.Utilities
-
Converts a decimal number into a string expressing percentage.
- persistence - Variable in class edu.uky.ai.planning.pg.StepNode
-
Whether or not this is a dummy persistence step
- plan - Variable in class edu.uky.ai.planning.ss.BackwardNode
-
The plan to reach the goal
- plan - Variable in class edu.uky.ai.planning.ss.ForwardNode
-
The plan taken to reach this state
- plan(Planner<?>, Problem, int, long, Writer) - Static method in class edu.uky.ai.planning.Main
-
Uses a given planner to solve a given problem.
- Plan - Interface in edu.uky.ai.planning
-
A plan is a sequence of step for achieving a goal.
- PlanGraph - Class in edu.uky.ai.planning.pg
-
plan graph is a data structure that compresses the state space of a planning problem into something that represents possible future states.
- PlanGraph(Problem, boolean, boolean) - Constructor for class edu.uky.ai.planning.pg.PlanGraph
-
Constructs a plan graph using all possible steps that could occur as the step nodes.
- PlanGraph(StateSpaceProblem, boolean, boolean) - Constructor for class edu.uky.ai.planning.pg.PlanGraph
-
Constructs a new plan graph using
all possible steps
for step nodes. - PlanGraphPlanner - Class in edu.uky.ai.planning.pg
-
A planner which searches a
PlanGraph
for a subgraph that represents a solution to a planning problem. - PlanGraphPlanner(String) - Constructor for class edu.uky.ai.planning.pg.PlanGraphPlanner
-
Constructs a new plan graph planner with the given name.
- PlanGraphSearch - Class in edu.uky.ai.planning.pg
-
Represents the two-phase search process of a
PlanGraphPlanner
. - planner - Variable in class edu.uky.ai.planning.Result
-
The planner that performed the search
- Planner<S extends Search> - Class in edu.uky.ai.planning
-
A planner is an algorithm which solves a planning problem by finding a plan.
- Planner(String) - Constructor for class edu.uky.ai.planning.Planner
-
Constructs a new planner with a given name.
- PlanningParser - Class in edu.uky.ai.planning.io
- PlanningParser() - Constructor for class edu.uky.ai.planning.io.PlanningParser
-
Constructs a new parser with rules for parsing planning objects.
- PlanSpaceNode - Class in edu.uky.ai.planning.ps
-
This class represents an specific partial plan in a plan-space search.
- PlanSpacePlanner - Class in edu.uky.ai.planning.ps
-
A subclass of
Planner
which uses plan-space search for find solutions. - PlanSpacePlanner(String) - Constructor for class edu.uky.ai.planning.ps.PlanSpacePlanner
-
Constructs a new plan-space planner with the given name.
- PlanSpaceRoot - Class in edu.uky.ai.planning.ps
-
A special subclass of
PlanSpaceNode
representing the root node of the search space. - PlanSpaceRoot(Problem, SearchBudget) - Constructor for class edu.uky.ai.planning.ps.PlanSpaceRoot
-
Constructs a new root node of a search space for a given problem.
- PlanSpaceSearch - Class in edu.uky.ai.planning.ps
-
A subclass of
Search
which represents plan-space search (i.e. - PlanSpaceSearch(Problem, SearchBudget) - Constructor for class edu.uky.ai.planning.ps.PlanSpaceSearch
-
Constructs a new plan space search object.
- pop() - Method in class edu.uky.ai.util.MinPriorityQueue
-
Removes and returns to the object with the lowest key.
- precondition - Variable in class edu.uky.ai.planning.Operator
-
What must be true before the action can be taken
- precondition - Variable in class edu.uky.ai.planning.ps.OpenPreconditionFlaw
-
The precondition of the step that needs to be satisfied
- precondition - Variable in class edu.uky.ai.planning.Step
-
What must be true before the step can be taken
- PRECONDITION_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify an operator's precondition
- preconditions - Variable in class edu.uky.ai.planning.pg.StepNode
-
All literal nodes which must be true before this step can happen
- preconditions - Variable in class edu.uky.ai.planning.ps.PartialStep
-
An array of this step's preconditions
- predicate - Variable in class edu.uky.ai.logic.Predication
-
The relationship between the terms, (often a preposition)
- PredicateLogicParser - Class in edu.uky.ai.logic.io
-
A parser for predicate logic, which expects all
Atom
s to bePredication
s. - PredicateLogicParser() - Constructor for class edu.uky.ai.logic.io.PredicateLogicParser
-
Constructs a new parser with rules for parsing predicate logic formulas.
- Predication - Class in edu.uky.ai.logic
-
The atoms of predicate logic, which are composed of statements that express relationships between things in the world (i.e.
- Predication(String, Term...) - Constructor for class edu.uky.ai.logic.Predication
-
Constructs a new predication with the given predicate and terms.
- Predication(String, ImmutableArray<Term>) - Constructor for class edu.uky.ai.logic.Predication
-
Constructs a new predication with the given predicate and terms.
- Predication(String, Iterable<Term>) - Constructor for class edu.uky.ai.logic.Predication
-
Constructs a new predication with the given predicate and terms.
- previous - Variable in class edu.uky.ai.planning.pg.Level
-
The previous level in this graph
- problem - Variable in class edu.uky.ai.planning.pg.PlanGraph
-
The planning problem represented by this plan graph
- problem - Variable in class edu.uky.ai.planning.ps.PlanSpaceRoot
-
The problem this search is trying to solve
- problem - Variable in class edu.uky.ai.planning.Result
-
The problem being solved
- problem - Variable in class edu.uky.ai.planning.Search
-
The problem being solved
- problem - Variable in class edu.uky.ai.planning.ss.BackwardRoot
-
The planning problem being solved
- problem - Variable in class edu.uky.ai.planning.ss.ForwardRoot
-
The planning problem being solved
- problem - Variable in class edu.uky.ai.planning.ss.StateSpaceSearch
-
The state space problem being solved
- Problem - Class in edu.uky.ai.planning
-
A planning problem exists in some
Domain
and defines the initial state of the world and a goal to be achieved. - Problem(String, Domain, Constant[], State, Proposition) - Constructor for class edu.uky.ai.planning.Problem
-
Constructs a new problem.
- Problem(String, Domain, ImmutableArray<Constant>, State, Proposition) - Constructor for class edu.uky.ai.planning.Problem
-
Constructs a new problem.
- PROBLEM_KEYWORD - Static variable in class edu.uky.ai.planning.io.PlanningParser
-
The keyword used to identify a problem
- producers - Variable in class edu.uky.ai.planning.pg.LiteralNode
-
All step nodes which have this literal as an effect
- Proposition - Interface in edu.uky.ai.logic
-
A proposition is any logical formula with a truth value.
- PropositionalLogicParser - Class in edu.uky.ai.logic.io
-
A parser for propositional logic, which expects all
Atom
s to beAtomicProposition
s. - PropositionalLogicParser() - Constructor for class edu.uky.ai.logic.io.PropositionalLogicParser
-
Constructs a new parser with rules for parsing propositional logic formulas.
- push(T, double) - Method in class edu.uky.ai.util.MinPriorityQueue
-
Associates an object with a given key and adds it to the queue.
R
- reason - Variable in class edu.uky.ai.planning.Result
-
A brief, human-readable explanation of the results
- remove(Atom) - Method in class edu.uky.ai.logic.HashState
- remove(Atom) - Method in interface edu.uky.ai.logic.MutableState
-
Makes a new atom false in this state.
- remove(NodeInstance) - Method in class edu.uky.ai.planning.pg.Subgraph
-
Returns a new subgraph which does not contain a given node at a given level.
- remove(Node, int) - Method in class edu.uky.ai.planning.pg.Subgraph
-
Returns a new subgraph which does not contain a given node at a given level.
- remove(Object) - Method in class edu.uky.ai.util.ImmutableList
-
Returns a list with the first occurrence of the given element removed.
- requireDefined(String, Class<E>) - Method in class edu.uky.ai.io.Parser
-
Like
Parser.getDefined(String, Class)
but throws an exception if no object is found. - requireFirst() - Method in class edu.uky.ai.io.List
-
Returns the first element in the list or throws an exception if no such element exists.
- requireNext() - Method in class edu.uky.ai.io.Node
-
Returns the node's next sibling or throws an exception if no such node exists.
- reset() - Method in class edu.uky.ai.planning.pg.Node
-
Resets this node (called when the plan graph is being reset).
- reset() - Method in class edu.uky.ai.planning.pg.StepNode
- rest - Variable in class edu.uky.ai.planning.pg.Subgraph
-
The rest of the subgraph
- rest - Variable in class edu.uky.ai.util.ImmutableList
-
The other elements in the list (elements 2 to n)
- Result - Class in edu.uky.ai.planning
-
A result contains information about how and why a search succeeded or failed.
- Result(Planner<?>, Problem, Plan, String, int, int, long) - Constructor for class edu.uky.ai.planning.Result
-
Constructs a new result object.
- root - Variable in class edu.uky.ai.planning.pg.SubgraphSearch
-
The root node of the search space
- root - Variable in class edu.uky.ai.planning.ps.PlanSpaceSearch
-
The root of the search space
- root - Variable in class edu.uky.ai.planning.ss.BackwardSearch
-
The root node of the search space (i.e.
- root - Variable in class edu.uky.ai.planning.ss.ForwardSearch
-
The root node of the search space (i.e.
- root - Variable in class edu.uky.ai.planning.ss.StateSpaceSearch
-
The root node of the search space (i.e.
- row - Variable in class edu.uky.ai.util.Table.Cell
-
The row this cell belongs to
- rows - Variable in class edu.uky.ai.util.Table
-
The table's rows
S
- Search - Class in edu.uky.ai.planning
-
A search is the process of exploring some space while looking for solutions to a problem.
- Search(Problem, SearchBudget) - Constructor for class edu.uky.ai.planning.Search
-
Constructs a new search for the given problem.
- SearchBudget - Class in edu.uky.ai
-
Represents the limitations placed on an algorithm in terms of how many operations it may perform and how long it make take to solve a problem.
- SearchBudget(int, long) - Constructor for class edu.uky.ai.SearchBudget
-
Constructs a new search budget that allows the given number of operations and the give amount of time.
- SearchBudgetExceededException - Exception in edu.uky.ai
-
Indicates that an algorithm has used more than the maximum allowed resources.
- set(Formula, Formula) - Method in class edu.uky.ai.logic.HashSubstitution
-
Specifies that a given formula should be replaced with another formula.
- setDefined(String, Object) - Method in class edu.uky.ai.io.Parser
-
Defines an object by name.
- setEqual(Term, Term) - Method in interface edu.uky.ai.logic.Bindings
-
Declares that two terms must have the same value.
- setEqual(Term, Term) - Method in class edu.uky.ai.logic.ListBindings
- setLevel(int) - Method in class edu.uky.ai.planning.pg.LiteralNode
- setLevel(int) - Method in class edu.uky.ai.planning.pg.Node
-
Marks this node as having first appeared at the given level.
- setLevel(int) - Method in class edu.uky.ai.planning.pg.StepNode
- setNotEqual(Term, Term) - Method in interface edu.uky.ai.logic.Bindings
-
Declares that two terms must have different values.
- setNotEqual(Term, Term) - Method in class edu.uky.ai.logic.ListBindings
- setParser(Class<E>, ObjectParser<? extends E>) - Method in class edu.uky.ai.io.Parser
-
Sets the
ObjectParser
for a the given type. - Settings - Class in edu.uky.ai.planning
-
Project settings
- Settings - Class in edu.uky.ai
-
Settings for all projects.
- Settings() - Constructor for class edu.uky.ai.planning.Settings
- Settings() - Constructor for class edu.uky.ai.Settings
- simplify() - Method in interface edu.uky.ai.logic.Atom
- simplify() - Method in class edu.uky.ai.logic.Conjunction
- simplify() - Method in class edu.uky.ai.logic.Disjunction
- simplify() - Method in class edu.uky.ai.logic.Implication
- simplify() - Method in class edu.uky.ai.logic.Negation
- simplify() - Method in interface edu.uky.ai.logic.Proposition
-
Returns an equivalent proposition which may be simpler.
- size() - Method in class edu.uky.ai.planning.BackwardPlan
- size() - Method in class edu.uky.ai.planning.ForwardPlan
- size() - Method in class edu.uky.ai.planning.pg.PlanGraph
-
Returns the number of levels in this graph.
- size() - Method in class edu.uky.ai.planning.pg.Subgraph
-
Indicates how many nodes this subgraph contains.
- size() - Method in interface edu.uky.ai.planning.Plan
-
Returns the number of steps in the plan.
- size() - Method in class edu.uky.ai.util.ImmutableArray
-
Returns the number of elements in the array.
- size() - Method in class edu.uky.ai.util.ImmutableList
-
Returns the number of elements in the list.
- size() - Method in class edu.uky.ai.util.MinPriorityQueue
-
Returns the number of objects currently stored in this queue.
- solution - Variable in class edu.uky.ai.planning.Result
-
The plan, or null if the search failed
- solve() - Method in class edu.uky.ai.planning.pg.PlanGraphSearch
- solve() - Method in class edu.uky.ai.planning.pg.SubgraphSearch
- solve() - Method in class edu.uky.ai.planning.Search
-
Searches the space until a solution is found.
- solve(Problem, int, long) - Method in class edu.uky.ai.planning.Planner
-
Returns a solution to the given problem.
- solve(Problem, SearchBudget) - Method in class edu.uky.ai.planning.Planner
-
Returns a solution to the given problem.
- sort(Comparator<? super Table.Row>, Comparator<? super Table.Column>) - Method in class edu.uky.ai.util.Table
-
Returns a new table whose rows and columns have been sorted according to the given comparators.
- sortByColumn(Comparator<? super Table.Column>) - Method in class edu.uky.ai.util.Table
-
Returns a new table whose columns have been sorted according to the given comparator.
- sortByRow(Comparator<? super Table.Row>) - Method in class edu.uky.ai.util.Table
-
Returns a new table whose rows have been sorted according to the given comparator.
- state - Variable in class edu.uky.ai.planning.ss.ForwardNode
-
The current state
- State - Interface in edu.uky.ai.logic
-
A state fully describes the disposition of all things in a world.
- StateSpaceHeuristic - Interface in edu.uky.ai.planning.ss
-
A state space heuristic estimates the distance (as number of steps) between a given state and a given goal proposition.
- StateSpaceNode - Interface in edu.uky.ai.planning.ss
-
Represents a node in a state space search graph.
- StateSpacePlanner<S extends StateSpaceSearch> - Class in edu.uky.ai.planning.ss
-
A planner which searches the space of states for the solution to a given problem.
- StateSpacePlanner(String) - Constructor for class edu.uky.ai.planning.ss.StateSpacePlanner
-
Constructs a new state space planner with a given name.
- StateSpaceProblem - Class in edu.uky.ai.planning.ss
-
A subclass of
Problem
that propositionalizes all theStateSpaceProblem.steps
that could possibly occur in a plan. - StateSpaceProblem(Problem) - Constructor for class edu.uky.ai.planning.ss.StateSpaceProblem
-
Constructs a new state space problem from a general planning problem.
- StateSpaceRoot - Interface in edu.uky.ai.planning.ss
-
A special
StateSpaceNode
that represents the root of the search space and holds a pointer to the problem object and the search budget. - StateSpaceSearch - Class in edu.uky.ai.planning.ss
-
Represents a search through the space of states.
- StateSpaceSearch(StateSpaceProblem, SearchBudget, StateSpaceRoot) - Constructor for class edu.uky.ai.planning.ss.StateSpaceSearch
-
Creates a state space search for a given problem.
- step - Variable in class edu.uky.ai.planning.pg.StepNode
-
The step represented by this node
- step - Variable in class edu.uky.ai.planning.ps.OpenPreconditionFlaw
-
The step for which some precondition has not been satisfied
- Step - Class in edu.uky.ai.planning
-
A step is a single ground action in a plan which changes the world's state.
- Step(String, Proposition, Proposition) - Constructor for class edu.uky.ai.planning.Step
-
Constructs a new step.
- stepMap - Variable in class edu.uky.ai.planning.pg.PlanGraph
-
A mapping of step objects to their corresponding nodes
- StepNode - Class in edu.uky.ai.planning.pg
-
Represents a unique step, or action, in a plan graph.
- StepNode(PlanGraph, Literal) - Constructor for class edu.uky.ai.planning.pg.StepNode
-
Constructs a dummy persistence step for a given literal (i.e.
- StepNode(PlanGraph, Step) - Constructor for class edu.uky.ai.planning.pg.StepNode
-
Constructs a new step node for the given literal in the given plan graph.
- steps - Variable in class edu.uky.ai.planning.pg.Level
-
All step nodes which exist at this level.
- steps - Variable in class edu.uky.ai.planning.ps.PlanSpaceNode
-
The steps in this plan
- steps - Variable in class edu.uky.ai.planning.ss.StateSpaceProblem
-
Every possible step that could be taken in a solution to this problem
- subgraph - Variable in class edu.uky.ai.planning.pg.SubgraphSpaceNode
-
A subset of nodes from the plan graph
- Subgraph - Class in edu.uky.ai.planning.pg
-
Represents a specific subset of nodes in a plan graph.
- Subgraph() - Constructor for class edu.uky.ai.planning.pg.Subgraph
-
Constructs an empty subgraph, containing no nodes.
- SubgraphSearch - Class in edu.uky.ai.planning.pg
-
This class represents the second phase of a
PlanGraphSearch
, in which we search for a subgraph of a plan graph that represents a solution to the problem. - SubgraphSearch(PlanGraph, SearchBudget, Subgraph) - Constructor for class edu.uky.ai.planning.pg.SubgraphSearch
-
Constructs a new subgraph space search process for the given plan graph and starting with the given subset of nodes from that graph.
- SubgraphSpaceNode - Class in edu.uky.ai.planning.pg
-
This class represents a specific subgraph of a plan graph during the search for a subgraph which represents a solution to the problem.
- SubgraphSpaceRoot - Class in edu.uky.ai.planning.pg
-
A special subclass of
SubgraphSpaceNode
representing the root node of the search space. - substitute(Substitution) - Method in interface edu.uky.ai.logic.Atom
- substitute(Substitution) - Method in class edu.uky.ai.logic.AtomicProposition
- substitute(Substitution) - Method in class edu.uky.ai.logic.Conjunction
- substitute(Substitution) - Method in class edu.uky.ai.logic.Constant
- substitute(Substitution) - Method in class edu.uky.ai.logic.Disjunction
- substitute(Substitution) - Method in interface edu.uky.ai.logic.Formula
-
Returns a version of this formula such that any elements that appear in the given substitution are replaced.
- substitute(Substitution) - Method in class edu.uky.ai.logic.Implication
- substitute(Substitution) - Method in interface edu.uky.ai.logic.Literal
- substitute(Substitution) - Method in class edu.uky.ai.logic.NegatedAtom
- substitute(Substitution) - Method in class edu.uky.ai.logic.Negation
- substitute(Substitution) - Method in class edu.uky.ai.logic.Predication
- substitute(Substitution) - Method in interface edu.uky.ai.logic.Proposition
- substitute(Substitution) - Method in class edu.uky.ai.logic.Term
- substituteArguments(Substitution) - Method in class edu.uky.ai.logic.BooleanProposition
-
Returns the arguments of this formula after applying the given substitution.
- Substitution - Interface in edu.uky.ai.logic
-
A substitution defines that certain formulas should be replaced by other formulas.
- subtract(Object, Object) - Static method in class edu.uky.ai.util.Utilities
-
Subtracts the second number object from the first.
- success - Variable in class edu.uky.ai.planning.Result
-
Whether or not the search was successful
- sum() - Method in class edu.uky.ai.util.Table.Sequence
-
Returns the sum of the numeric elements of this sequence (non-numeric values are ignored).
- sum(Function<Object, ?>) - Method in class edu.uky.ai.util.Table.Sequence
-
Returns the sum of the numeric elements of this sequence (non-numeric values are ignored).
- Symbol - Class in edu.uky.ai.io
-
A symbol is a string of characters.
T
- table - Variable in class edu.uky.ai.util.Table.Cell
-
The table this cell belongs to
- table - Variable in class edu.uky.ai.util.Table.Sequence
-
The table this sequence belongs to
- Table - Class in edu.uky.ai.util
-
Logic for displaying simple 2-dimensional tables of data.
- Table(Iterable<?>, Iterable<?>) - Constructor for class edu.uky.ai.util.Table
-
Constructs a new, empty table with rows and columns that have the given labels.
- Table(Object[], Object[]) - Constructor for class edu.uky.ai.util.Table
-
Constructs a new, empty table with rows and columns that have the given labels.
- Table.Cell - Class in edu.uky.ai.util
-
An individual unit of data in the table.
- Table.Column - Class in edu.uky.ai.util
-
A vertical sequence of cells.
- Table.Row - Class in edu.uky.ai.util
-
A horizontal sequence of cells.
- Table.Sequence - Class in edu.uky.ai.util
-
The abstract parent of
Table.Row
andTable.Column
. - tail - Variable in class edu.uky.ai.planning.ps.CausalLink
-
The earlier step
- tail - Variable in class edu.uky.ai.util.DirectedEdge
-
The first or 'before' object
- Term - Class in edu.uky.ai.logic
-
A term is a reference to an individual thing in the world, and does not have a truth value.
- Term(String, String) - Constructor for class edu.uky.ai.logic.Term
-
Constructs a term from the given type and name.
- terms - Variable in class edu.uky.ai.logic.Predication
-
The terms between which the relationship holds
- threat - Variable in class edu.uky.ai.planning.ps.ThreatenedCausalLinkFlaw
-
The threatening step
- ThreatenedCausalLinkFlaw - Class in edu.uky.ai.planning.ps
-
An threatened causal link flaw indicates that a partial plan contains a causal link such that the effect of its tail step might be undone by some other step in the plan (the threat) before it is used by the causal link's tail step.
- ThreatenedCausalLinkFlaw(CausalLink, PartialStep) - Constructor for class edu.uky.ai.planning.ps.ThreatenedCausalLinkFlaw
-
Constructs a new threatened causal link flaw for the given causal link and threatening step.
- time - Variable in class edu.uky.ai.planning.Result
-
The amount of time the search took (in milliseconds)
- time(long) - Static method in class edu.uky.ai.util.Utilities
-
Converts a duration in milliseconds into a formatted string expressing showing minutes, seconds, and milliseconds.
- TIME_LIMIT - Static variable in class edu.uky.ai.planning.Settings
-
The default maximum number of milliseconds that a planner may take to solve a problem
- TimeBudgetExceededException - Exception in edu.uky.ai
-
Indicates that an algorithm has taken more than the allowed amount of time.
- toArray(Iterable<? extends T>, Class<T>) - Static method in class edu.uky.ai.util.Utilities
-
Efficiently converts any
Iterable
into an array of its elements. - toCNF() - Method in class edu.uky.ai.logic.Conjunction
- toCNF() - Method in class edu.uky.ai.logic.Disjunction
- toCNF() - Method in class edu.uky.ai.logic.Implication
- toCNF() - Method in interface edu.uky.ai.logic.Literal
- toCNF() - Method in class edu.uky.ai.logic.NegatedAtom
- toCNF() - Method in class edu.uky.ai.logic.Negation
- toCNF() - Method in interface edu.uky.ai.logic.Proposition
-
Converts this proposition to Conjunctive Normal Form (CNF).
- toDNF() - Method in class edu.uky.ai.logic.Conjunction
- toDNF() - Method in class edu.uky.ai.logic.Disjunction
- toDNF() - Method in class edu.uky.ai.logic.Implication
- toDNF() - Method in interface edu.uky.ai.logic.Literal
- toDNF() - Method in class edu.uky.ai.logic.NegatedAtom
- toDNF() - Method in class edu.uky.ai.logic.Negation
- toDNF() - Method in interface edu.uky.ai.logic.Proposition
-
Converts this proposition to Disjunctive Normal Form (DNF).
- toHTML() - Method in class edu.uky.ai.util.Table
-
Returns an HTML representation of this table.
- toLiterals(Proposition) - Static method in class edu.uky.ai.planning.Utilities
-
Since the precondition and effect of an action should be either a literal or a conjunction of literals, this utility method takes such a proposition and converts it into an array of literals.
- toProposition() - Method in interface edu.uky.ai.logic.State
-
Represents this state as a proposition which would be true in this state and false in any other state (typically a
Conjunction
of allAtom
s that are currently true). - toString() - Method in class edu.uky.ai.io.List
- toString() - Method in class edu.uky.ai.io.Symbol
- toString() - Method in class edu.uky.ai.logic.AtomicProposition
- toString() - Method in class edu.uky.ai.logic.Conjunction
- toString() - Method in class edu.uky.ai.logic.Disjunction
- toString() - Method in class edu.uky.ai.logic.HashState
- toString() - Method in class edu.uky.ai.logic.Implication
- toString() - Method in class edu.uky.ai.logic.ListBindings
- toString() - Method in class edu.uky.ai.logic.Negation
- toString() - Method in class edu.uky.ai.logic.Predication
- toString() - Method in class edu.uky.ai.logic.Term
- toString() - Method in class edu.uky.ai.logic.Variable
- toString() - Method in class edu.uky.ai.planning.BackwardPlan
- toString() - Method in class edu.uky.ai.planning.Domain
- toString() - Method in class edu.uky.ai.planning.ForwardPlan
- toString() - Method in class edu.uky.ai.planning.Operator
- toString() - Method in class edu.uky.ai.planning.pg.LiteralNode
- toString() - Method in class edu.uky.ai.planning.pg.NodeInstance
- toString() - Method in class edu.uky.ai.planning.pg.PlanGraph
- toString() - Method in class edu.uky.ai.planning.pg.StepNode
- toString() - Method in class edu.uky.ai.planning.pg.Subgraph
- toString() - Method in class edu.uky.ai.planning.pg.SubgraphSpaceNode
- toString() - Method in class edu.uky.ai.planning.Planner
- toString() - Method in class edu.uky.ai.planning.Problem
- toString() - Method in class edu.uky.ai.planning.ps.CausalLink
- toString() - Method in class edu.uky.ai.planning.ps.Flaw
- toString() - Method in class edu.uky.ai.planning.ps.OpenPreconditionFlaw
- toString() - Method in class edu.uky.ai.planning.ps.PartialStep
- toString() - Method in class edu.uky.ai.planning.ps.PlanSpaceNode
- toString() - Method in class edu.uky.ai.planning.Result
- toString() - Method in class edu.uky.ai.planning.ss.BackwardNode
- toString() - Method in class edu.uky.ai.planning.ss.ForwardNode
- toString() - Method in class edu.uky.ai.planning.Step
- toString() - Method in class edu.uky.ai.SearchBudget
- toString() - Method in class edu.uky.ai.util.DirectedAcyclicGraph
- toString() - Method in class edu.uky.ai.util.DirectedEdge
- toString() - Method in class edu.uky.ai.util.ImmutableArray
- toString() - Method in class edu.uky.ai.util.Table.Cell
- toString() - Method in class edu.uky.ai.util.Table.Column
- toString() - Method in class edu.uky.ai.util.Table.Row
- toString() - Method in class edu.uky.ai.util.Table
- toString() - Method in class edu.uky.ai.util.Tuple
- toString(Substitution) - Method in class edu.uky.ai.planning.ps.CausalLink
- toString(Substitution) - Method in class edu.uky.ai.planning.ps.OpenPreconditionFlaw
- toString(Substitution) - Method in interface edu.uky.ai.planning.ps.Partial
-
Returns a string representation of this object in which all variables which have values in the given substitution have been replaced with those values.
- toString(Substitution) - Method in class edu.uky.ai.planning.ps.PartialStep
- toString(Substitution) - Method in class edu.uky.ai.planning.ps.PlanSpaceNode
- toString(Substitution) - Method in class edu.uky.ai.planning.ps.ThreatenedCausalLinkFlaw
- transform(Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table whose cell values are the results of applying the given function to the values in this table.
- transform(Predicate<? super Table.Row>, Predicate<? super Table.Column>) - Method in class edu.uky.ai.util.Table
-
Returns a new table which only keeps the row and columns of this table that are identified by two predicates.
- transform(Predicate<? super Table.Row>, Predicate<? super Table.Column>, Function<Object, ?>) - Method in class edu.uky.ai.util.Table
-
Returns a new table which only keeps the row and columns of this table that are identified by two predicates and whose cell values are the results of applying the given function to the values in this table.
- TRUE - Static variable in interface edu.uky.ai.logic.Proposition
-
A proposition which is always trivially true
- Tuple - Class in edu.uky.ai.util
-
A tuple is simply an array of
Object
s implemented such that two tuples are the same (i.e. - Tuple(int) - Constructor for class edu.uky.ai.util.Tuple
-
Constructs a tuple of a given size with each element as null.
- Tuple(Object...) - Constructor for class edu.uky.ai.util.Tuple
-
Constructs a tuple from a given set of objects.
- type - Variable in class edu.uky.ai.logic.Term
-
The term's type.
U
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.AtomicProposition
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Conjunction
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Disjunction
- unify(Formula, Bindings) - Method in interface edu.uky.ai.logic.Formula
-
Finds the bindings that would be necessary to make this formula the same as another formula (if any exist).
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Implication
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Negation
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Predication
- unify(Formula, Bindings) - Method in class edu.uky.ai.logic.Term
- unifyArguments(Formula, Bindings) - Method in class edu.uky.ai.logic.BooleanProposition
-
Unifies this formula's arguments with the arguments of another Boolean proposition.
- Utilities - Class in edu.uky.ai.planning
-
A assortment of useful methods.
- Utilities - Class in edu.uky.ai.util
-
Assorted helpful methods.
- Utilities() - Constructor for class edu.uky.ai.planning.Utilities
- Utilities() - Constructor for class edu.uky.ai.util.Utilities
V
- value - Variable in class edu.uky.ai.io.Symbol
-
The value of the symbol
- value - Variable in class edu.uky.ai.util.Table.Cell
-
The current value of this cell
- Variable - Class in edu.uky.ai.logic
-
A variable represents a placeholder for a
Term
. - Variable(String, String) - Constructor for class edu.uky.ai.logic.Variable
-
Constructs a new variable with the given type and name.
- VERSION_UID - Static variable in class edu.uky.ai.Settings
-
A UID number constructed from the major and minor version numbers
- visited - Variable in class edu.uky.ai.planning.Result
-
The number of nodes visited during the search
W
- write(char[], int, int) - Method in class edu.uky.ai.io.DummyWriter
- write(int) - Method in class edu.uky.ai.io.DummyOutputStream
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form