The following pages link to (Q3396552):
Displayed 8 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- An abstract view on optimizations in SAT and ASP (Q2055811) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- LCF-Style Propositional Simplification with BDDs and SAT Solvers (Q3543649) (← links)