===========================================================

ASP2007

4th International Workshop on Answer Set Programming

September 8 and 13, 2007

Porto, Portugal

TENTATIVE PROGRAM

===========================================================

September 8

8:30-8:50 Registration

8:50-9:00 Opening

9:00-10:30 Invited talk

Strong Equivalence and Relatives - Logically and Algebraically

10:30-11:00 Coffee Break

11:00-12:15 Advances in Implementation

Experiments with Answer Set Computation over Parallel and Distributed Architectures

G. Grossi, M. Marchi, E. Pontelli, and A. Provetti

Improving the AdjSolver Algorithm for ASP Kernel Programs

G. Grossi, M. Marchi, and A. Provetti

Looking Back in DLV: Experiments and Comparison to QBF Solvers

Wolfgang Faber, Nicola Leone, Marco Maratea, and Francesco Ricca

12:15-14:20 Lunch

14:20-16:00 Agents and Ontologies

Modeling Cooperative Multi-Agent Systems

Gregory Gelfond and Richard Watson

An Extension of SOLP for Cooperative Flexible Agents

Francesco Buccafurri and Gianluca Caminiti

OntoDLV: an ASP-based System for Enterprise Ontologies

Tina Dell'Armi, Lorenzo Gallucci, Nicola Leone, Francesco Ricca, and

Roman Schindlauer

Faithful and effective querying of RDF ontologies using DLV^DB

Giovambattista Ianni, Alessandra Martello, Claudio Panetta, and

Giorgio Terracina

16:00-16:30 Coffee Break

16:30-16:55 Experiments

An Experience of Using ASP for Toy Examples

Yves Moinard

16:55-17:45 Theory

From (Quantified) Boolean Formulae to Answer Set Programming

Benoit Da Mota, Igor Stéphan, and Pascal Nicolas

Computing Answer Sets Using Model Generation Theorem Provers

Orkunt Sabuncu and Ferda N. Alpaslan

===========================================================

September 13

9:30-10:30 Panel: Challenging Applications of ASP

10:30-11:00 Coffee Break

11:00-12:15 Advances in Implementation and System Demonstrations

The Significance of Memory Costs in Answer Set Solver Implementation

Martin Brain and Marina De Vos

smodels-ie : Improving the Cache Utilisation of Smodels

Martin Brain. Marina De Vos, and Ken Satoh

MidL: a SAT(ID) solver

Maarten Marien, Johan Wittocx, and Marc Denecker

12:15-12:40 Extensions

Incremental Answer Set Programming: A Preliminary Report

Mona Gharib, Robert Mercer, and Torsten Schaub

12:40-14:45 Lunch

14:45-15:10 Extensions

Incremental Answer Sets and Their Computation

Martin Gebser, Mona Gharib, and Torsten Schaub

15:10-16:00 Theory

Properties of Update Sequences

Mauricio Osorio and Claudia Zepeda

Semantics for Possibilistic Disjunctive Programs

Juan Carlos Nieves, Mauricio Osorio, and Ulises Cortés

16:00-16:30 Coffee Break

16:30-17:20 Theory

Answer Set Semantics vs Information Term Semantics

Camillo Fiorentini and Mario Ornaghi

A Translation-based Approach to the Verification of Modular Equivalence

Emilia Oikarinen and Tomi Janhunen

17:20-18:10 Applications and Extensions

Solving Challenging Grid Puzzles with Answer Set Programming

Merve Cayli, Ayse Gul Karatop, Emrah Kavlak, Hakan Kaynar,

Ferhan Ture, and Esra Erdem

Answer Set Programming with Resources

Stefania Costantini and Andrea Formisano

18:10 Closure

===========================================================