-
Learning subgoals can
reduce cognitive load when
problem solving because the
learner has
fewer possible problem-solving
steps to focus.
Subgoal-labeled...
-
repeatedly uses
rules to
further reduce subgoals to
other subgoals,
until it
eventually succeeds in
unifying all
subgoals with
facts in the program. This backward...
- The
empty clause is
simply an
empty set of
subgoals,
which signals that the
initial conjunction of
subgoals in the top
clause has been solved. SLD resolution...
- generated.
Backward reasoning,
which succeeds by
reducing a goal to
subgoals,
until all
subgoals are
solved by facts,
ensures that the goal is true in the minimal...
- eXtensible. The user
gives PhoX an
initial goal and
guides it
through subgoals and
evidence to
prove that goal; internally, it
constructs natural deduction...
-
distal goals.[page needed]
Complexity of a goal is
determined by how many
subgoals are
necessary to
achieve the goal and how one goal
connects to another...
- And.intro -- the goal is
split into two
subgoals, one is q and the
other is p ·
exact h.right -- the
first subgoal is
exactly the
right part of h : p ∧ q...
- state. For example,
planning algorithms search through trees of
goals and
subgoals,
attempting to find a path to a
target goal, a
process called means-ends...
- of the clauses, and
execution proceeds with the
subgoals B1, …, Bn of the
chosen clause.
These subgoals can also be
executed in parallel. Thus concurrent...
-
problems (or goals) to
conjunctions and
disjunctions of
subproblems (or
subgoals). The and-or tree:
represents the
search space for
solving the problem...
