Backdoors to planning
From MaRDI portal
Publication:2321271
DOI10.1016/j.artint.2018.10.002zbMath1478.68323OpenAlexW2905745689MaRDI QIDQ2321271
Sebastian Ordyniak, Martin Kronegger, Andreas Pfandler
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.10.002
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (7)
An algorithmic framework for locally constrained homomorphisms ⋮ Backdoors for linear temporal logic ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic ⋮ A multiparametric view on answer set programming ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backdoors to q-Horn
- Fundamentals of parameterized complexity
- Satisfiability of acyclic and almost acyclic CNF formulas
- The influence of \(k\)-dependence on the complexity of planning
- Limitations of acyclic causal graphs for planning
- Backdoors into heterogeneous classes of SAT and CSP
- Causal graphs and structurally restricted planning
- Optimal admissible composition of abstraction heuristics
- Backdoor sets of quantified Boolean formulas
- State-variable planning under structural restrictions: algorithms and complexity
- Theory and algorithms for plan merging
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- Variable and term removal from Boolean formulae
- Star-topology decoupled state space search
- The complexity landscape of decompositional parameters for ILP
- Augmenting tractable fragments of abstract argumentation
- Planning in a hierarchy of abstraction spaces
- Describing parameterized complexity classes
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Backdoors to tractable answer set programming
- A complete parameterized complexity analysis of bounded planning
- On the complexity of planning for agent teams and its implications for single agent planning
- Bounded-width QBF is PSPACE-complete
- Parametrized complexity theory.
- A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
- Backdoors to Acyclic SAT
- Backdoors to Satisfaction
- Distributed Heuristic Forward Search for Multi-agent Planning
- Elections with Few Candidates: Prices, Weights, and Covering Problems
- Incompressibility through Colors and IDs
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
- Backdoors to Normality for Disjunctive Logic Programs
- Parameterized Algorithms
This page was built for publication: Backdoors to planning
