Week 5: Answer Set Programming

• Slides

• Graph coloring (example)

• Hamiltonian Cycle (example, incorrect)

• Hamiltonian Cycle (example, correct)

• Exercise sheet

• N Queens (efficient encoding)

• N Queens (naive encoding)

• Sudoku encoding

• Multi-Agent Path Finding (naive encoding)

• Multi-Agent Path Finding (smarter encoding)

• Multi-Agent Path Finding (benchmark 1)

• Multi-Agent Path Finding (benchmark 2)

• Multi-Agent Path Finding (benchmark 3)

• Multi-Agent Path Finding (benchmark 4)

• Multi-Agent Path Finding (large benchmark grid)

• Exercise sheet (solutions)