From Logic Programs Updates to Action Description Updates

Alferes, José Júlio; Banti, Federico; Brogi, Antonio

doi:10.1007/11533092_4

Cited by 9 publications

(5 citation statements)

References 18 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that [2] is similar to our work in that updates that consist of static/dynamic rules are described in the same language as the action description. On the other hand, the language of [2] allows us to talk about, as a part of the updates, changes over rules (using the assert construct).…”

Section: Related Workmentioning

confidence: 99%

“…Some of the related work mentioned above, like [5,45,2,32], study action description updates in connection with the problem of elaboration tolerance. The goal is to answer the following question: how can an action description be updated to tolerate new elaborations on the action domain?…”

Section: Related Workmentioning

confidence: 99%

“…Another related work that studies action description updates, for elaboration tolerance, is [2]. The authors introduce an action description language, called Evolp Action Programs (EAPs), built upon the update language Evolp [3].…”

Section: Related Workmentioning

confidence: 99%

“…The works by Lifschitz [45] and by Balduccini and Gelfond [5] are similar to [2] in that they also modify action descriptions with respect to new elaborations, by means of adding causal laws, in the sense of additive elaboration tolerance [48,50]. Lifschitz describes in [45] an action domain in language C such that every causal law is defeasible (by means of an abnormality predicate).…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Comparing action descriptions based on semantic preferences

Eiter

Erdem

Fink

et al. 2007

Ann Math Artif Intell

View full text Add to dashboard Cite

Abstract.Incorporating new information into a knowledge base is an important problem which has been widely considered. In this paper, we study the problem in a formal framework for reasoning about action and change, in which action domains are described in an action language that has a transition-based semantics. Going beyond previous works, we consider (i) a richer action language that allows for non-deterministic, and concurrent actions, as well as the representation of indirect effects and dependencies between fluents, (ii) more general updates than elementary statements, and, most importantly, (iii) meta-level knowledge, such as observations, assertions, or general domain properties that remain invariant under change, expressed in an action query language. For this setting, we formalize a notion of update of an action domain description, relative to a generic preference relation on action domain descriptions that selects most preferred solutions. We study semantic and computational aspects of this notion, where we establish basic properties of updates and a decomposition result that gives rise to a divide and conquer approach to computing solutions under certain conditions. Furthermore, we study the computational complexity of decision problems around computing solutions, both for the generic setting and for two particular preference relations, viz. set-inclusion and weight-based preference. While deciding the existence of solutions and recognizing solutions are PSPACE-complete problems in general, the problems fall back into the polynomial hierarchy under restrictions on the meta-level conditions. We finally discuss methods to compute solutions and approximate solutions (which disregard preference). Our results provide a semantic and computational basis for developing systems that incorporate new information into action descriptions in an action language, in the presence of additional conditions at the meta-level.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Comparing action descriptions based on semantic preferences

Eiter

Erdem

Fink

et al. 2007

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…This allows, for instance, to better use LPs for representing and reasoning with knowledge that evolves in time, as required in several fields of application. The LP updates framework has been used, for instance, as the base of the MINERVA agent architecture [14] and of the action description language EAPs [4].…”

Section: Introductionmentioning

confidence: 99%

Operational Semantics for DyLPs

Banti

Alferes

Brogi

2005

Progress in Artificial Intelligence

View full text Add to dashboard Cite

Abstract. Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly dynamic domains with logic programming techniques. Two of the most recent results are the definition of the refined stable and the well founded semantics for dynamic logic programs that extend stable model and well founded semantic to the dynamic case. We present here alternative, although equivalent, operational characterizations of these semantics by program transformations into normal logic programs. The transformations provide new insights on the computational complexity of these semantics, a way for better understanding the meaning of the update programs, and also a methodology for the implementation of these semantics. In this sense, the equivalence theorems in this paper constitute soundness an completeness results for the implementations of these semantics.

show abstract

Desire-Space Analysis and Action Selection for Multiple Dynamic Goals

Han

Barber

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

From Logic Programs Updates to Action Description Updates

Cited by 9 publications

References 18 publications

Comparing action descriptions based on semantic preferences

Comparing action descriptions based on semantic preferences

Operational Semantics for DyLPs

Desire-Space Analysis and Action Selection for Multiple Dynamic Goals

Contact Info

Product

Resources

About