3. OF THIS PROCEDURE IS A UNIVERSALLY QUANTIFIED RULE IMMEDI...
section 2.3.
of this procedure is a universally quantified rule
Immediately upon reading the current state, the
having the form
C∧GR
→A.
Amay represent
system checks to see if this is a goal state. A goal
either the name of an action in the world or an
state is a state who’s corresponding textual domain
internal predicate. C represents the necessary
representation contains an explicit answer in the
right form to match the questions. In the abstract
condition for rule activation in the form of a
representation, we say that in this state all of the
conjunction over the relevant attributes of the
goal constraints are satisfied.
world state.
GR
represents the expected effect of
If the current state is indeed a goal state, no
the action. For example,
x1
∧x2
∧g2
→turn_on_x2further inference is required. The inference
process terminates and the actual answer is
indicates that when
x1
is on and
x2
is off, this
identified by the matching technique described in
operator is expected to turn
x2