Parameterized Complexity of DPLL Search Procedures.
Olaf BeyersdorffNicola GalesiMassimo LauriaPublished in: ACM Trans. Comput. Log. (2013)
Keyphrases
- search procedures
- parameterized complexity
- np complete
- fixed parameter tractable
- sat solvers
- search strategies
- satisfiability problem
- symmetry breaking
- constraint satisfaction problems
- global constraints
- search algorithm
- search space
- propositional logic
- search procedure
- propositional satisfiability
- search tree
- search methods
- sat problem
- constraint satisfaction
- metaheuristic
- constraint programming
- max sat
- bounded treewidth
- first order logic
- routing problem
- game tree
- beam search
- np hard
- search strategy
- branch and bound
- special case
- conjunctive queries
- computational complexity