Introduction to SAT (constraint) solving - Crest

More documents

Recommendations

Info

Conflict Analysis - implication graph
Conflict Analysis - conflict clause Candidate conflict clauses: ¬(x 3 = 0 ∧ x 2 = 0 ∧ x 0 = 1) ↔ x 3 ∨ x 2 ∨ ¬x 0 or ¬(x 3 = 0 ∧ x 2 = 0) ↔ x 3 ∨ x 2 or ¬(x 2 = 0 ∧ x 0 = 1) ↔ x 2 ∨ ¬x 0 First Unit Implication Point (First UIP) scheme adds a conflict clause that contains only one variable that is assigned at the current decision level (a so-called asserting clause).
Page 1 and 2: Introduction to SAT (constraint) so
Page 3 and 4: The 8-queens problem
Page 5 and 6: SAT example x 1 ∨ x 2 ∨ ¬x 4
Page 7 and 8: The 8-queens problem : SAT model p
Page 9 and 10: Example background theories for SMT
Page 11 and 12: The Constraint Satisfaction Problem
Page 13 and 14: SAT, SMT or CSP ◮ SAT: + extremel
Page 15 and 16: A short introduction to SAT solving
Page 17 and 18: SAT solver classification Most wide
Page 19 and 20: SAT solvers are extremely efficient
Page 23 and 24: SAT Applications ◮ Bounded Model
Page 25 and 26: CDCL SAT solver
Page 27 and 28: Unit propagation x 0 ∨ x 2 ∨ x
Page 29 and 30: Unit propagation x 0 ∨ x 2 ¬x 2
Page 31 and 32: Unit propagation x 0 ¬x 2 ∨ ¬x
Page 33 and 34: Unit propagation x 0 : satisfied ¬
Page 35: Conflict Analysis (late 90s) MiniSA
Page 39 and 40: SAT, SMT and CSP solvers are used f
Page 43 and 44: References ◮ Armin Biere, ed. Han

Introduction to SAT (constraint) solving - Crest

Create successful ePaper yourself

Delete template?

Save as template?