Example: bankruptcy
The Boolean Satisfiability Problem (SAT) - Ptolemy Project
• Stochastic search – Local search, hill climbing, etc. – Unable to prove unsatisfiability (incomplete) 24 DLL Algorithm: General Ideas • Iteratively set variables until – you find a satisfying assignment (done!) – you reach a conflict (backtrack and try different value) • Two main rules:
Download The Boolean Satisfiability Problem (SAT) - Ptolemy Project
Information
Domain:
Source:
Link to this page: