Program

All sessions will take place in Suite 3002 unless otherwise indicated.

Wednesday, August 16th

Wednesday's program is also available with abstracts or side by side with other meetings.

08:50‑09:50  Session 1: Opening and Invited Talk

08:50	Opening Remarks
09:00	Mirek Truszczynski (University of Kentucky) Knowledge representation languages --- a programmer's interface to satisfiability [pdf]

09:50‑10:30  Session 2: Contributed Talks

09:50	Enrico Giunchiglia , Yuliya Lierler, Marco Maratea and Armando Tacchella Experiments with SAT-based Answer Set Programming
10:10	Maarten Mariën, Johan Wittocx and Marc Denecker The IDP framework for declarative problem solving

10:30‑11:00  Break

11:00‑12:30  Session 3: Tutorials

11:00	Ilka Niemela (Helsinki University of Technology) Answer Set Programming: Foundations, Implementation Techniques, and Applications [pdf]
11:40	John Franco (University of Cincinnati) Experiences in the Research and Development of a Non-Clausal SAT Solver

12:30‑14:00  Lunch break

14:00‑14:50  Session 4: Invited Talk

14:00

Henry Kautz (University of Washington) Deconstructing Planning as Satisfiability [ppt]

14:50‑15:30  Session 5: Contributed Talks

14:50	Martin Gebser and Torsten Schaub Characterizing ASP Inferences by Unit Propagation
15:10	John Schlipf and Ryan Flannery Unfounded Sets and Autarkies

15:30‑16:00  Break

16:00‑17:20  Session 6: Contributed Talks

16:00	Murray Patterson , Yongmei Liu, Eugenia Ternovska and Arvind Gupta Grounding for Model Expansion in $k$-Guarded Formulas
16:20	Johannes Oetsch, Martina Seidl, Hans Tompits and Stefan Woltran ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming
16:40	Lengning Liu and Mirek Truszczynski Solving Optimization Problems with Boolean Combinations of Pseudo-boolean Constraints (a preliminary report)

17:20‑18:00  Session 7: Panel and Discussion

17:20

Panel: J. Franco, V. Marek, D. Mitchell, I. Niemela, E. Ternovska (Chair)