Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?
Markus HecherPublished in: KR (2020)
Keyphrases
- answer set programming
- answer set solvers
- satisfiability problem
- sat solvers
- web applications
- modulo theories
- boolean satisfiability
- np complete
- phase transition
- max sat
- propositional satisfiability
- search algorithm
- search space
- sat problem
- stochastic local search
- variable ordering
- sat solving
- logic programs
- space complexity
- neural network
- worst case
- upper bound
- lower bound