Conformant Planning with Static Causal Laws and Negation as Failure: Decomposition of the ASP Approach
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 size of 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 comparison with an alternative planning system DLV K.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.