Fluent calculus
From Wikipedia, the free encyclopedia
The fluent calculus is a formalism 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 a situation. For example, that the box is on the table in the situation s is represented by the formula 
. The frame problem is solved by asserting that the situation after the execution of an action is identical to the one before but for the conditions changed by the action. For example, the action of moving the box from the table to the floor is formalized as:
This formula states that the state after the move is added the term on(box,floor) and removed the term on(box,table). Axioms specifying that is commutative and non-idempotent are necessary for such axioms to work.
[edit] See also
[edit] Reference
- M. Thielscher (1998). Introduction to the fluent calculus. Electronic Transactions on Artificial Intelligence, 2(3-4):179-192.
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
