Dependent Fluents Dependent Fluents
نویسندگان
چکیده
universitt a di genova facoltt a di ingegneria dipartimento informatica sistemistica telematica Abstract We discuss the persistence of the indirect effects of an action|the question when such effects are subject to the commonsense law of inertia , and how to describe their evolution in the cases when inertia does not apply. Our model of nonpersistent eeects involves the assumption that the value of the uent in question is determined by the values of other uents, although the dependency may be partially or completely unknown. This view leads us to a new high-level action language ARD (for Actions, Ram-iications and Dependencies) that is capable of describing both persistent and nonpersistent effects. Unlike the action languages introduced in the past, ARD is \non-Markovian," in the sense that the evolution of the uents described in this language may depend on their history, and not only on their current values.
منابع مشابه
Abductive Partial Order Planning with Dependent Fluents
Our query planning application for system integration requires a backward partial-order planner able to deal with non-ground plans in the presence of state constraints. While many partial-order planners exist for the case of independent fluents, partial-order planning with dependent fluents is a significantly more complex problem, which we tackle in an abductive event calculus framework. We sho...
متن کاملDependent Fluents
We discuss the persistence of the indirect effects of an action—the question when such effects are subject to the commonsense law of inertia, and how to describe their evolution in the cases when inertia does not apply. Our model of nonpersistent effects involves the assumption that the value of the fluent in question is determined by the values of other fluents, although the dependency may be ...
متن کاملUniversit a Di Pisa a Logic-based Calculus of Fluents a Logic-based Calculus of Fluents Universit a Degli Studi Di Pisa Dipartimento Di Informatica a Logic-based Calculus of Fluents
This report formally deenes the class of all problems on Reasoning about Actions and Change, where accurate and complete information about actions, together with strict inertia in continuous time, continuous change and alternative results of possibly concurrent and independent actions are the assumed properties. The intended model set for each member in the class is deened in terms of a model-t...
متن کاملNumeric Planning via Search Space Abstraction
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...
متن کاملFluent Learning: Elucidating the Structure of Episodes
Fluents are logical descriptions of situations that persist, and composite fluents are statistically significant temporal relationships (nearly identical with those in Allen’s temporal calculus) between fluents. This paper presents an algorithm for learning composite fluents incrementally. The algorithm is tested with a large dataset of mobile robot episodes. The algorithm is given no knowledge...
متن کاملCumulative Effects of Concurrent Actions on Numeric-Valued Fluents
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows formalizing concurrent actions whose effects increment/decrement the value of additive fluents. For describing indirect effects, we employ mathematical equations in a manner that is inspired by recent work on causality a...
متن کامل