| 9:00 | 9:05 | Opening |
| 9:05 | 9:25 |
| FO(ID) as an extension of DL with rules | | Joost Vennekens, Marc Denecker |
|
| 9:25 | 9:45 |
| Efficient Parallel ASP Instantiation via Dynamic Rewriting | | Simona Perri, Francesco Ricca, Saverio Vescio |
|
| 9:45 | 10:05 |
| Modeling preferences on resource consumption and production in ASP | | Stefania Costantini, Andrea Formisano |
|
| 10:05 | 10:25 |
| Towards Logic Programs with Ordered and Unordered Disjunction | | Philipp Kärger, Nuno Lopes, Axel Polleres, Daniel Olmedilla |
|
| 10:25 | 10:45 |
| Quantified Logic Programs, Revisited | | Rachel Ben-Eliyahu-Zohary |
|
| 10:45 | 11:10 |
Coffee Break
|
| 11:10 | 11:30 |
| On Demand Indexing for the DLV Instantiator | | Gelsomina Catalano, Nicola Leone, Simona Perri |
|
| 11:30 | 11:50 |
| Integrating Grounding in the Search Process for Answer Set Computing | | Claire Lefèvre, Pascal Nicolas |
|
| 11:50 | 12:10 |
| Answer-Set Programming Encodings for Argumentations Frameworks | | Uwe Egly, Sarah Gaggl, Stefan Woltran |
|
| 12:10 | 12:30 |
| Classical Logic Event Calculus as Answer Set Programming | | Joohyung Lee, Ravi Palla |
|