Satisfiability Encodings (04)
Michael L. Littman
January 26th, 1999
SATISFIABILITY
Recap
Applications
SAT ENCODINGS
Graph Coloring
SAT as a CSP
3-SAT as a CSP
CSP as SAT
BATTLESHIPS
Encoding a Complex Problem
Battleships Instructions
Battleships
Objects
Variables
Initial Conditions
Footprints
Counts
All Else Empty
Encoding Inference Rules
USING THE SOLVER
Input Format
Output Format
Next:
SATISFIABILITY
