Parameterized Complexity of DPLL Search Procedures.
Olaf BeyersdorffNicola GalesiMassimo LauriaPublished in: SAT (2011)
Keyphrases
- search procedures
- parameterized complexity
- np complete
- fixed parameter tractable
- satisfiability problem
- sat solvers
- search strategies
- constraint satisfaction problems
- symmetry breaking
- search algorithm
- propositional logic
- sat problem
- search procedure
- global constraints
- search space
- propositional satisfiability
- search tree
- bounded treewidth
- search methods
- first order logic
- max sat
- metaheuristic
- np hard
- constraint satisfaction
- conjunctive queries
- beam search
- computational problems
- constraint programming
- phase transition
- heuristic search
- particle swarm optimization
- computational complexity
- evolutionary algorithm