Multiagent Systems

Prof. Dr. Jürgen Dix · Department of Informatics, TUC Multiagent Systems, WS 06/07 426/731
6. Propositional Logic 3. Sudoku
Can they be solved with sentential logic?
Idea: Given a Sudoku-Puzzle S, construct a
language L Sudoku and a theory T S ⊆ F ml LSudoku
such that
MOD(T S ) = Solutions of the puzzle S
Solution
In fact, we construct a theory T Sudoku and for
each (partial) instance of a 9 × 9 puzzle S a
particular theory T S such that
MOD(T Sudoku ∪ T S ) = {S : S is a solution of S}