Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?
Markus HecherPublished in: Artif. Intell. (2022)
Keyphrases
- answer set programming
- answer set solvers
- modulo theories
- web applications
- sat solvers
- boolean satisfiability
- satisfiability problem
- sat solving
- sat problem
- max sat
- search algorithm
- phase transition
- search strategies
- search space
- stochastic local search algorithms
- genetic algorithm
- branch and bound
- np complete
- upper bound
- abnormal behavior
- objective function