Showing papers on "Qualification problem published in 2001"
TL;DR: This work presents a logic programming method to cope with the Qualification Problem in the action programming language Flux, which builds on the Fluent Calculus as a solution to the fundamental Frame Problem.
Abstract: The Qualification Problem arises for planning agents in real-world environments, where unexpected circumstances may at any time prevent the successful performance of an action. We present a logic programming method to cope with the Qualification Problem in the action programming language Flux, which builds on the Fluent Calculus as a solution to the fundamental Frame Problem. Our system allows to plan under the default assumption that actions succeed as they normally do, and to reason about these assumptions in order to recover from unexpected action failures.
11 citations
Proceedings Article•
4 Aug 2001
TL;DR: The qualification problem is studied in the setting of the situation calculus and a simple formalization using nested abnormality theories, a formalism based on circumscription is given, which allows for a solution to the frame problem with a solutions to the qualification problem.
Abstract: The qualification problem refers to the difficulty that arises in formalizing actions, because it is difficult or impossible to specify in advance all the preconditions that should hold before an action can be executed. We study the qualification problem in the setting of the situation calculus and give a simple formalization using nested abnormality theories, a formalism based on circumscription. The formalization that we present allows us to combine a solution to the frame problem with a solution to the qualification problem.
4 citations
Proceedings Article•
10 Dec 2001
TL;DR: This paper is the first in which the frame and the qualification problems in a simplifying setting without domain constraints or ramifications are solved, and the theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic.
Abstract: We present a uniform nonmonotonic solution for the problem of reasoning about action on the basis of argumentation-theoretic approach in a series of paper. This paper is the first one in which we solve the frame and the qualification problems in a simplifying setting without domain constraints or ramifications. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic.
4 citations
10 Dec 2001
TL;DR: In this article, a uniform non-monotonic solution for the problem of reasoning about action on the basis of argumentation-theoretic approach in a series of paper is presented, which is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic.
Abstract: We present a uniform nonmonotonic solution for the problem of reasoning about action on the basis of argumentation-theoretic approach in a series of paper. This paper is the first one in which we solve the frame and the qualification problems in a simplifying setting without domain constraints or ramifications. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a temporal propositional logic.
2 citations
TL;DR: This work presents an approach to the Qualification Problem which resolves the anomaly of ignoring causality and builds on the established predicate logic formalism of the Fluent Calculus as a solution to the Frame Problem and to the Ramification Problem in reasoning about actions.