Fluent (artificial intelligence)

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{On}(mathrm{box},mathrm{table}); a third argument is necessary to the predicate mathrm{On} to specify the time: mathrm{On}(mathrm{box},mathrm{table},t) means that the box is on the table at time t. This representation of fluents is used in the situation calculus 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. Converting predicates as functions in first-order logic 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.

ee also

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


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( …   Wikipedia

  • Philosophy of artificial intelligence — The philosophy of artificial intelligence considers the relationship between machines and thought and attempts to answer such question as: [Harvnb|Russell|Norvig|2003|p=947 define the philosophy of AI as consisting of the first two questions, and …   Wikipedia

  • Fluent — can refer to:* fluency, in linguistics, the ability to communicate quickly. * fluent (mathematics), in mathematics, a continuous function * fluent (artificial intelligence), in artificial intelligence, a condition that varies over time * Fluent,… …   Wikipedia

  • Fluent calculus — The fluent calculus is a formalism for expressing dynamical domains in first order logic. It is a variant of the situation calculus; the main difference is that situations are considered representations of states. A binary function symbol circ is …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Category:Logic in computer science — Logic in computer science is that branch of mathematical logic which is approximately the intersection between mathematical logic and computer science. It contains: Those investigations into logic that are guided by applications in computer… …   Wikipedia

  • Frame problem — In artificial intelligence, the frame problem was initially formulated as the problem of expressing a dynamical domain in logic without explicitly specifying which conditions are not affected by an action. John McCarthy and Patrick J. Hayes… …   Wikipedia

  • Situation calculus — The situation calculus is a logic formalism designed for representing and reasoning about dynamical domains. It was first introduced by John McCarthy in 1963. The main version of the situational calculus that is presented in this article is based …   Wikipedia

  • Yale shooting problem — The Yale shooting problem is a conundrum or scenario in formal situational logic on which early logical solutions to the frame problem fail. The name of this problem derives from its inventors, Steve Hanks and Drew McDermott, working at Yale… …   Wikipedia

  • Android — An android is a robot designed to resemble a human, usually both in appearance and behavior. The word derives from ανδρός, the genitive of the Greek ανήρ anēr , meaning man , and the suffix eides , used to mean of the species; alike (from eidos,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”