Backdoors to Planning
نویسندگان
چکیده
Backdoors measure the distance to tractable fragments and have become an important tool to find fixed-parameter tractable (fpt) algorithms. Despite their success, backdoors have not been used for planning, a central problem in AI that has a high computational complexity. In this work, we introduce two notions of backdoors building upon the causal graph. We analyze the complexity of finding a small backdoor (detection) and using the backdoor to solve the problem (evaluation) in the light of planning with (un)bounded plan length/domain of the variables. For each setting we present either an fpt-result or rule out the existence thereof by showing parameterized intractability. In three cases we achieve the most desirable outcome: detection and evaluation are fpt.
منابع مشابه
Variable-Deletion Backdoors to Planning
Backdoors are a powerful tool to obtain efficient algorithms for hard problems. Recently, two new notions of backdoors to planning were introduced. However, for one of the new notions (i.e., variable-deletion) only hardness results are known so far. In this work we improve the situation by defining a new type of variabledeletion backdoors based on the extended causal graph of a planning instanc...
متن کاملBackdoors in Planning and Scheduling Problems
A backdoor is a set of assignments to a problem that yield the rest of the problem polynomially determinable. Backdoors have been shown to have interesting relationships with problem hardness, backbones and other properties. We show deeper insight into the relationship between backdoors and backbones than has previously been shown. The effect of no-good clause learning on backdoors is also dis-
متن کاملAbstraction and Search
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of formal understanding why this works so well. Focussing on the Planning context, we identify a form of problem structure concerned with the symmetrical or asymmetrical nature of the cost of achie...
متن کاملBackdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can handle combinatorial problems with up to a million variables and five million constraints. The good scaling behavior of these methods appears to defy what one would expect based on a worst-case complexity analysis. In ord...
متن کاملPlanning CNFs with Small DPLL Proofs
In order to better understand SAT-based planning and, more broadly, the good performance of current DPLL-based SAT solvers on real-world instances, we design three CNF formula families, two of which are derived from synthetic planning domains. The formulas are parameterized both in their size and in the amount of inherent structure. We investigate DPLL search tree size via the intermediate noti...
متن کامل