Many real-world planning problems are best modeled as infinite search space problems, using numeric fluents. Unfortunately, most planners and planning heuristics do not directly support such fluents. We propose a search space abstraction technique that compiles a planning problem with numeric fluents into a finite state propositional planning problem. To account for the loss of precision result...

FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledge. The mathematical foundations of FLUX are given by the fluent calculus, which provides a solution to the fundamental frame problem in classical logic. We show how FLUX can be readily used as a platform for specifyin...

Aiming at the former formalized methods of robot planning should give the environment state, can not obtain the new knowledge of the environment. In order to improve the reason ability for obtaining new knowledge of the environment state, the actions in the process of planning such as external action and sensing action are formalized. A formalized reasoning method—CPNI (Colored Petri Net for Pl...

Planning is a natural domain of application for frameworks of reasoning about actions and change. In this paper we study how one such framework, the Language E , can form the basis for planning under (possibly) incomplete information. We define two types of plans: weak and safe plans, and propose a planner, called the E-Planner, which is often able to extend an initial weak plan into a safe pla...

The Situation Calculus and the Fluent Calculus are successful action formalisms that share many concepts. But until now there is no formal relation between the two calculi that would allow to formally analyze the relationship between the two approaches as well as between the programming languages based on them, Golog and FLUX. Furthermore, such a formal relation would allow to combine Golog and...

Several extensions of the stable model semantics are available to describe “intensional” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were ...

Agents need to know the effects of their actions. Strong associations between actions and effects can be found by counting how often they co-occur. We present an algorithm that learns temporal patterns expressed as fluents, propositions with temporal extent. The fluent-learning algorithm is hierarchical and unsupervised. It works by maintaining co-occurrence statistics on pairs of fluents. In e...

In this paper we will show that a recently proposed method for ABox updates in Description Logics can be given a Fluent Calculus semantics. This allows the usage of Description Logic ABoxes as decidable state descriptions. We discuss some natural extensions of the method and the arising issues. Finally, we present an action programming language implementing this Fluent Calculus fragment using a...

For the ANSYS CFD codes CFX and Fluent coupling links to several 1D codes exist allowing for a wide range of multi-physics applications. As an example, a flexible coupling infrastructure in terms of supported multiphysics coupling conditions between ANSYS CFX and LMS AMESim is outlined. Examples of the wide range of coupling solutions of ANSYS CFD (CFX and Fluent) and coupled 1D-3D applications...