Concept

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 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 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 and removed the term . Axioms specifying that is commutative and non-idempotent are necessary for such axioms to work.

Source officielle

https://en.wikipedia.org/wiki/Fluent_calculus

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Cours associés (1)

ME-474: Numerical flow simulation

This course provides practical experience in the numerical simulation of fluid flows. Numerical methods are presented in the framework of the finite volume method. A simple solver is developed with Matlab, and a commercial software is used for more complex ...

Séances de cours associées (2)

Turbulence : Simulation numérique de flux

Explore les caractéristiques de la turbulence, les méthodes de simulation et les défis de modélisation, fournissant des lignes directrices pour le choix et la validation des modèles de turbulence.

Calcul parallèle; Visualisation

Explore le calcul parallèle dans CFD, en mettant l'accent sur sa mise en œuvre dans Fluent et les techniques de visualisation pour l'interprétation des données scientifiques.

Publications associées (2)

A Mechanized Theory of the Box Calculus

Capture calculus is an extension of System Fsub that tracks free variables of terms in their type, allowing one to represent capabilities while limiting their scope. While previous calculi had mechanized soundness proofs, the latest version, namely the box calculus, only had a paper proof. We present here our work on mechanizing the theory of the box calculus in Coq, and the challenges encountered along the way.

2023

ACCESS - Algebraic Concurrent Events for System Specification

Didier Buchs

Access is a new algebraic specification formalism, which focuses on the fine description of the ``true'' concurrency and on a high degree of expressivity. Systems are specified by a set of local states, whose value changes under the occurrence of events. Both events and data structure are specified by abstract data types. Static properties, i.e. global constraints over events and data structure, are described by first order formulae, while dynamic axioms, explaining the behavior of events, are given by caus

1994

Personnes associées (1)

Barbara Smith

Expertise Organisation, coordination et gestion de congrès Mission Responsable du cycle de conférences internationales CISBAT.

Concepts associés (2)

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 ; a third argument is necessary to the predicate to specify the time: means that the box is on the table at time .

Event calculus

The event calculus is a logical language for representing and reasoning about events and their effects first presented by Robert Kowalski and Marek Sergot in 1986. It was extended by Murray Shanahan and Rob Miller in the 1990s. Similar to other languages for reasoning about change, the event calculus represents the effects of actions on fluents. However, events can also be external to the system. In the event calculus, one can specify the value of fluents at some given time points, the events that take place at given time points, and their effects.

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.