Pages that link to "Item:Q1699519"
From MaRDI portal
The following pages link to What is answer set programming to propositional satisfiability (Q1699519):
Displaying 7 items.
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- An abstract view on optimizations in SAT and ASP (Q2055811) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Block structured scheduling using constraint logic programming (Q5145461) (← links)
- An abstract view on optimizations in propositional frameworks (Q6496423) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)