This video provides an introduction to optimization in ASP while focusing on the capacities of the clasp 3 series. The first part sets the stage by describing a well-known ASP encoding of the traveling salesperson problem. The second part introduces clasp’s two basic approaches to optimization, viz. the branch-and-bound and unsatisfiable-core-based approach, and it discusses the different phases of optimization processes, namely convergence and optimality. Part three introduces a quite effective design pattern for modeling optimization problems (thanks to Martin Gebser). Part four is dedicated to clasp’s manifold heuristics and strategies related to optimization:

Video (part one 12:01, part two 8:21, part three 14:16, part four 3:58: A 6:28, B 22:29), Script (org, html, tex, pdf, txt), Files (tgz, zip)