Fluent (artificial Intelligence)

In artificial intelligence, a fluent is a condition that can change over time. In logical approaches to reasoning about actions, fluents can be represented in first-order logic by predicates having an argument that depends on time. For example, the condition "the box is on the table", if it can change over time, cannot be represented by $\mathrm(\mathrm,\mathrm)$; a third argument is necessary to the predicate $\mathrm$ to specify the time: $\mathrm(\mathrm,\mathrm,t)$ means that the box is on the table at time $t$. This representation of fluents is modified in the situation calculus by using the sequence of the past actions in place of the current time.

A fluent can also be represented by a function, dropping the time argument. For example, that the box is on the table can be represented by $on(box,table)$, where $on$ is a function and not a predicate. In first order logic, converting predicates to functions is called reification; for this reason, fluents represented by functions are said to be reified. When using reified fluents, a separate predicate is necessary to tell when a fluent is actually true or not. For example, $HoldsAt(on(box,table),t)$ means that the box is actually on the table at time $t$, where the predicate $HoldsAt$ is the one that tells when fluents are true. This representation of fluents is used in the event calculus, in the fluent calculus, and in the features and fluents logics.

Some fluents can be represented as functions in a different way. For example, the position of a box can be represented by a function $on(box,t)$ whose value is the object the box is standing on at time $t$. Conditions that can be represented in this way are called ''functional fluents''. Statements about the values of such functions can be given in first order logic with equality using literals such as $on(box,t)=table$. Some fluents are represented this way in the situation calculus.

Naive physics

From a historical point of view, fluents were introduced in the context of qualitative reasoning. The idea is to describe a process model not with mathematical equations but with natural language. That means an action is not only determined by its trajectory, but with a symbolic model, very similar to a text adventure. Naive physics stands in opposition to a numerical physics engine and has the obligation to predict the outcome of actions. The fluent realizes the common sense grounding between the robot's motion and the task description in natural language.

From a technical perspective, a fluent is equal to a parameter that is parsed by the naive physics engine. The parser converts between natural language fluents and numerical values measured by sensors. As a consequence, the human-machine interaction is improved.

See also

* Event calculus
* Fluent calculus
* Frame problem
* Situation calculus

References

Logic in computer science

{{plt-stub