← Mathematical compendium

Published equation contexts

pre(a)⊆s  ⟹  δ(s,a)=(s∖del(a))∪add(a)\mathrm{pre}(a) \subseteq s \;\Longrightarrow\; \delta(s,a) = \big(s \setminus \mathrm{del}(a)\big) \cup \mathrm{add}(a)

Why this formula appears here

The planner underneath Shakey was STRIPS — the Stanford Research Institute Problem Solver — described by Fikes and Nilsson in a 1971 paper in the journal Artificial Intelligence . STRIPS represented the world as a set of predicate-logic statements, represented each available action as an operator with a precondition list, a delete list, and an add list, and used a resolution theorem prover guided by means-ends analysis to search for a sequence of operators connecting the current state to a goal state [ 2 ] . Formally, for a state s represented as a set of ground predicates and an operator a with precondition set pre(a)\mathrm{pre}(a) , delete set del(a)\mathrm{del}(a) , and add set add(a)\mathrm{add}(a) , the…

Read the full article-specific guide →

Read the representative guide

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

pre(a)⊆s  ⟹  δ(s,a)=(s∖del(a))∪add(a).\mathrm{pre}(a) \subseteq s \;\Longrightarrow\; \delta(s,a) = \big(s \setminus \mathrm{del}(a)\big) \cup \mathrm{add}(a).

Equation 6 · AI Agents & Systems

From Scripted Bots to Autonomous Agents: A History of AI Agent Architecture

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

The planner underneath Shakey was STRIPS — the Stanford Research Institute Problem Solver — described by Fikes and Nilsson in a 1971 paper in the journal Artificial Intelligence . STRIPS represented the world as a set of predicate-logic statements, represented each available action as an operator with a precondition list, a delete list, and an add list, and used a resolution theorem prover guided by means-ends analysis to search for a sequence of operators connecting the current state to a goal state [ 2 ] . Formally, for a state s represented as a set of ground predicates and an operator a with precondition set pre(a)\mathrm{pre}(a) , delete set del(a)\mathrm{del}(a) , and add set add(a)\mathrm{add}(a) , the…

Equation guide → · Article →