Approximation of action theories and its application to conformant planning (Q543583): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(8 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Conformant planning is an approach that devises a plan which reaches a given goal from a set of possible initial states of the world. In this article, approximation theories for the action language AL are studied and applied to the problem of generating conformant plans. Approximations replace the non-deterministic transition diagrams caused by causal laws in AL, where actions can have indirect effects, by a deterministic transition diagram with partial states. The article shows that a concise description of such an approximation can often be given by a logic program under the answer sets semantics. Complex initial situations and constraints on plans are expressed by logic programming rules. With this technique, the problem of finding a conformant plan can be reduced to computing the answer sets of the logic program. For this purpose, general answer set solvers can be used. The article describes several planning algorithms based on these solvers and gives a sufficient condition for their completeness, i.e., for finding a plan if one exists. Experiments are presented where the algorithms are compared to other state-of-the-art conformant planners on a number of well-known benchmarks and two new benchmarks which are rich in static causal laws. | |||
Property / review text: Conformant planning is an approach that devises a plan which reaches a given goal from a set of possible initial states of the world. In this article, approximation theories for the action language AL are studied and applied to the problem of generating conformant plans. Approximations replace the non-deterministic transition diagrams caused by causal laws in AL, where actions can have indirect effects, by a deterministic transition diagram with partial states. The article shows that a concise description of such an approximation can often be given by a logic program under the answer sets semantics. Complex initial situations and constraints on plans are expressed by logic programming rules. With this technique, the problem of finding a conformant plan can be reduced to computing the answer sets of the logic program. For this purpose, general answer set solvers can be used. The article describes several planning algorithms based on these solvers and gives a sufficient condition for their completeness, i.e., for finding a plan if one exists. Experiments are presented where the algorithms are compared to other state-of-the-art conformant planners on a number of well-known benchmarks and two new benchmarks which are rich in static causal laws. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T37 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68T27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5909436 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
conformant planning | |||
Property / zbMATH Keywords: conformant planning / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reasoning about action and change | |||
Property / zbMATH Keywords: reasoning about action and change / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
knowledge representation | |||
Property / zbMATH Keywords: knowledge representation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
incomplete information | |||
Property / zbMATH Keywords: incomplete information / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
answer set programming | |||
Property / zbMATH Keywords: answer set programming / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Smodels / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Cmodels / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PDDL / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Graphplan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.artint.2010.04.007 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000712072 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using temporal logics to express search control knowledge for planning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diagnostic reasoning with A-Prolog / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Answer set based design of knowledge systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational complexity of planning and approximate planning in the presence of incompleteness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2734940 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis on the <i>p</i>-adic superspace. I. Generalized functions: Gaussian distribution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3624010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SAT-based planning in complex domains: Concurrency, constraints and nondeterminism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4527271 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conformant planning via symbolic model checking and heuristic search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4940938 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representing action and change by logic programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representing action: indeterminacy and ramifications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2717791 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Answer set programming and plan generation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the logic of causal explanation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4449294 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5633670 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending and implementing the stable model semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formalizing sensing actions -- a transition function based approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domain-dependent knowledge in answer set planning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramification and causality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representing actions in logic programs and default theories a situation calculus approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4708911 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:04, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation of action theories and its application to conformant planning |
scientific article |
Statements
Approximation of action theories and its application to conformant planning (English)
0 references
17 June 2011
0 references
Conformant planning is an approach that devises a plan which reaches a given goal from a set of possible initial states of the world. In this article, approximation theories for the action language AL are studied and applied to the problem of generating conformant plans. Approximations replace the non-deterministic transition diagrams caused by causal laws in AL, where actions can have indirect effects, by a deterministic transition diagram with partial states. The article shows that a concise description of such an approximation can often be given by a logic program under the answer sets semantics. Complex initial situations and constraints on plans are expressed by logic programming rules. With this technique, the problem of finding a conformant plan can be reduced to computing the answer sets of the logic program. For this purpose, general answer set solvers can be used. The article describes several planning algorithms based on these solvers and gives a sufficient condition for their completeness, i.e., for finding a plan if one exists. Experiments are presented where the algorithms are compared to other state-of-the-art conformant planners on a number of well-known benchmarks and two new benchmarks which are rich in static causal laws.
0 references
conformant planning
0 references
reasoning about action and change
0 references
knowledge representation
0 references
incomplete information
0 references
answer set programming
0 references
0 references
0 references
0 references
0 references
0 references