Program
Saturday April 20th, 2002
Session I (10:30-12:30)
- 10:30-11:30 Invited speaker Marc Denecker: Unifying stable and
abductive logic programming
- 11:30-12:00 P.A. Bonatti:
Abduction, ASP and Open Logic Programs
- 12:00-12:30 Ken Satoh:
Speculative Computation and Abduction for an Autonomous Agent
12:30-14:00 Lunch
Session II (14:00-16:00)
- 14:00-14:30 F. Calimeri, W. Faber, N. Leone, and G. Pfeifer:
Pruning Operators for Answer Set Programming Systems
- 14:30-15:00 Thomas Linke, Christian Anger, and Katrin Konczak:
More on noMoRe
- 15:00-15:30 Victor W. Marek and Jeffrey B. Remmel:
On Logic Programs with Cardinality Constraints
- 15:30-16:00 Pedro Cabalar:
Alternative Characterizations for Strong Equivalence of Logic Programs
16:00-16:30 Coffee break
Session III (16:30-18:30)
- 16:30-17:00
Torsten Schaub and Kewen Wang:
Preferred Well-Founded Semantics for Logic Programming
by Alternating Fixpoints: Preliminary Report
- 17:00-17:30
Sibylle Schwarz:
Answer Sets Generated by Selector Functions
- 17:30-18:30 Panel discussion: Relationship between ALP and ASP
Panelists: Tony Kakas, Ken Satoh, Torsten Schaub, Mirek Truscszynski