Login / Signup
Fixed-Parameter Tractable Reductions to SAT for Planning.
Ronald de Haan
Martin Kronegger
Andreas Pfandler
Published in:
IJCAI (2015)
Keyphrases
</>
fixed parameter tractable
parameterized complexity
np hard
computational problems
satisfiability problem
np complete
global constraints
search algorithm
sat solvers
heuristic search
computational complexity
search strategies