Jump to content

Fluent calculus

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tizio (talk | contribs) at 12:19, 21 October 2005 (summary). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The fluent calculus is a formalisms for expressing dynamical domains in first order logic. It is similar to the situation calculus; the main difference is that situations are considered representations of states. A binary function symbol is used to concatenate the terms that represent facts that hold in the current situation. For example, that the box is on the table in the situation is represented by the formula .

See also

Reference