Solving Hard Disjunctive Logic Programs Faster (Sometimes).
Gerald PfeiferPublished in: APPIA-GULP-PRODE (2003)
Keyphrases
- solving hard
- combinatorial problems
- satisfiability problem
- search problems
- stochastic local search
- propositional logic
- disjunctive logic programming
- propositional satisfiability
- constraint programming
- combinatorial optimization
- answer set programming
- sat problem
- traveling salesman problem
- phase transition
- minimal models
- metaheuristic
- search algorithm
- constraint satisfaction
- orders of magnitude
- heuristic search
- constraint satisfaction problems
- genetic algorithm
- special case
- stable models
- np complete
- global constraints
- sat solvers