Login / Signup
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?
Markus Hecher
Published in:
CoRR (2022)
Keyphrases
</>
answer set programming
answer set solvers
satisfiability problem
sat solvers
search space
search algorithm
sat problem
modulo theories
web applications
sat solving
logic programming
propositional satisfiability
answer set programs
answer sets
sat encodings
pseudo boolean constraints