Backdoors to planning
From MaRDI portal
Publication:2321271
Recommendations
Cites work
- A complete parameterized complexity analysis of bounded planning
- A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
- Augmenting tractable fragments of abstract argumentation
- Automatically generating abstractions for planning
- Backdoor sets of quantified Boolean formulas
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to acyclic SAT
- Backdoors to normality for disjunctive logic programs
- Backdoors to q-Horn
- Backdoors to satisfaction
- Backdoors to tractable answer set programming
- Bounded-width QBF is PSPACE-complete
- Causal graphs and structurally restricted planning
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Describing parameterized complexity classes
- Discovering archipelagos of tractability for constraint satisfaction and counting
- Distributed heuristic forward search for multi-agent planning
- Elections with few candidates: prices, weights, and covering problems
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1946870 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Incompressibility through Colors and IDs
- Limitations of acyclic causal graphs for planning
- New islands of tractability of cost-optimal planning
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- On the complexity of planning for agent teams and its implications for single agent planning
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Optimal admissible composition of abstraction heuristics
- Parameterising the complexity of planning by the number of paths in the domain-transition graphs
- Parameterized algorithms
- Parametrized complexity theory.
- Planning in a hierarchy of abstraction spaces
- Planning over chain causal graphs for variables with domains of size 5 is NP-hard
- Satisfiability of acyclic and almost acyclic CNF formulas
- Star-topology decoupled state space search
- State-variable planning under structural restrictions: algorithms and complexity
- The complexity landscape of decompositional parameters for ILP
- The complexity of planning problems with simple causal graphs
- The computational complexity of propositional STRIPS planning
- The influence of k-dependence on the complexity of planning
- Theory and algorithms for plan merging
- Variable and term removal from Boolean formulae
Cited in
(9)- Backdoors for linear temporal logic
- On structural parameterizations of the bounded-degree vertex deletion problem
- A multiparametric view on answer set programming
- Cost-optimal planning, delete relaxation, approximability, and heuristics
- Computational Short Cuts in Infinite Domain Constraint Satisfaction
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- An algorithmic framework for locally constrained homomorphisms
- An algorithmic framework for locally constrained homomorphisms
- Backdoor DNFs
This page was built for publication: Backdoors to planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321271)
