Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00227821" target="_blank" >RIV/68407700:21230/14:00227821 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach
Original language description
In recent years, we have seen a few attempts to use the Answer Set Programming (ASP) to solve the problem of conformant planning with the support for causal laws and negation as failure. Typically, the whole planning domain is encoded into a large ASP meta-program expressing what holds and which actions should be executed in all the time steps of a resulting plan. Answer sets of this meta-program then represent all the possible plans. Since the complexity of answer set computation is exponential in sizeof input, we propose a technique of dividing it into several smaller meta-programs - one for every state transition. Actual plan finding can then be outsourced to a graph-search algorithm. This method increases the performance of planning with ASP semantics and allows us to produce considerably longer plans. After discussing the worst-case complexity of both approaches, we introduce the prototype ASP planner GRASP that employs our suggested technique and provide the experimental compari
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)