ICLP program

Sessions take place in auditorium 4 unless otherwise indicated.

Monday July 29th

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

09:15-10:30  Session 1: Introduction and Best Papers
Chair: Peter Stuckey and Henning Christiansen

09:15  Introduction and Prize Giving
09:30  Alessandra Russo, Imperial College, UK; Rob Miller, U College London, UK; Bashar Nuseibeh, The Open U, UK; and Jeff Kramer, Imperial College, UK
An abductive approach for analysing event-based requirements specifications
10:00  Tom Schrijvers, K.U. Leuven, Belgium; María García de la Banda, Monash U, Australia; and Bart Demoen, K.U. Leuven, Belgium
Trailing analysis for HAL

10:30-11:00  Refreshments

11:00-12:30  Session 2: Applications I
Chair: Ulf Nilsson

11:00  Steve Barker, U Westminster, UK
Access control for deductive databases by logic programming
11:30  Kung-Kiu Lau, U Manchester, UK and Michel Vanden Bossche, Mission Critical, Belgium
Logic programming for software engineering: A second chance
12:00  Alexander Bockmayr and Arnaud Courtois, LORIA Nancy, France
Using hybrid concurrent constraint programming to model dynamic biological systems

12:30-14:00  Lunch

14:00-15:30  Session 3: Invited Tutorial

14:00  David S. Warren, State U of New York-Stony Brook, USA
Invited tutorial: Tabled logic programming

15:30-16:00  Refreshments

16:00-17:30  Session 4: Tabling and Deductive Databases
Chair: Kostis Sagonas

16:00  Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski; MPI Saarbrücken, Germany
Constraint-based infinite model checking and tabulation for stratified CLP
16:30  Giridhar Pemmasani, C. R. Ramakrishnan, and I. V. Ramakrishnan; State U of New York-Stony Brook, USA
Efficient real-time model checking using tabled logic programming and constraints
17:00  Hasan M. Jamil, Mississipi State U, USA and Gillian Dobbie, U Auckland, New Zealand
A model theoretic semantics for multi-level secure deductive databases

17:30-18:30  Poster session
Room: Lobby

18:40-19:00  ICLP Bus leaving to City Hall
Room: Main entrance

19:00-21:00  City Hall reception (joint with CADE, CAV, TABLEAUX)
Room: City Hall

Tuesday July 30th

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

09:00-10:30  Session 5: Constraints
Chair: Sandro Etalle

09:00  Bernard Boigelot and Pierre Wolper, U Liege, Belgium
Invited talk: Representing arithmetic constraints with finite automata: An overview
10:00  Michael Maher, Loyola U Chicago, USA
Propagation completeness of reactive constraints

10:30-11:00  Refreshments

11:00-12:30  Session 6: Memory Management
Chair: David S. Warren

11:00  Henning Makholm, U Copenhagen, Denmark and Kostis Sagonas, Uppsala U, Sweden
On enabling the WAM with region support
11:30  Bart Demoen, K.U. Leuven, Belgium; Phuong-Lan Nguyen, Catholic U of the West, France; and Ruben Vandeginste, K.U. Leuven, Belgium
Copying garbage collection for the WAM: To mark or not to mark ?
12:00  Bart Demoen, K.U. Leuven, Belgium
A different look at garbage collection for the WAM

12:30-14:00  Lunch

14:00-15:30  Session 7: Invited Tutorial

14:00  Thom Frühwirth, U Munich, Germany
Invited tutorial: Constraint handling rules

15:30-16:00  Refreshments

16:00-17:30  Session 8: Programming and Extensions
Chair: Henning Christiansen

16:00  Harald Ganzinger, MPI Saarbrücken, Germany and David McAllester, AT&T Labs, USA
Logical algorithms
16:30  Joachim Schimpf, Imperial College, UK
Logical loops
17:00  Eric Martin, U New South Wales, Australia; Phuong Nguyen, U New South Wales, Australia; Arun Sharma, U New South Wales, Australia; and Frank Stephan, U Heidelberg, Germany
Learning in logic with RichProlog

17:30-18:30  Association of Logic Programming general meeting

18:30-21:00  Prolog Programming Competition
Room: DIKU

Wednesday July 31st

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

09:00-10:30  Session 9: World Wide Web
Chair: Peter Stuckey

09:00  Stefan Decker, Stanford U, USA
Invited talk: Logic databases on the semantic web: Challenges and opportunities
10:00  François Bry and Sebastian Schaffert, U Munich, Germany
Towards a declarative query and transformation language for XML and semistructured data: Simulation unification

10:30-11:00  Refreshments

11:00-12:30  Session 10: Theory
Chair: Michael Maher

11:00  Brigitte Pientka, Carnegie Mellon U, USA
A proof-theoretic foundation for tabled higher-order logic programming
11:30  Sorin Craciunescu, INRIA Rocquencourt, France
Proving the equivalence of CLP programs
12:00  Paola Bruscoli, Dresden U of Techn., Germany
A purely logical account of sequentiality in proof search

12:30-14:00  Lunch

14:00-15:30  Session 11: Invited Tutorial

14:00  Miroslaw Truszczynski, U Kentucky, USA
Invited tutorial: Answer set programming

15:30-16:00  Refreshments

16:00-16:30  Session 12: Stable Models and Answer Sets I
Chair: Mirek Truszczynski

16:00  Katsumi Inoue, Kobe U, Japan and Chiaki Sakama, Wakayama U, Japan
Disjunctive explanations

18:00-19:30  ICLP boat trip excursion; leaving from *Nyhavn*
Room: Nyhavn

19:30-22:00  Conference dinner (joint with TABLEAUX)
Room: Restaurant Luftkastellet

19:30  Banquet
20:30  Veronica Dahl, Simon Fraser U, Canada (Banquet speaker)

Thursday August 1st

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

09:00-10:30  Session 13: Stable Models and Answer Sets II
Chair: Katsumi Inoue

09:00  Piero A. Bonatti, U Milan, Italy
Reasoning with infinite stable models II: Disjunctive programs
09:30  Zbigniew Lonc, Warsaw U of Techn., Poland and Miroslaw Truszczynski, U Kentucky, USA
Computing stable models: Worst-case performance estimates
10:00  Yannis Dimopoulos and Andreas Sideris, U Cyprus
Towards local search for answer sets

10:30-11:00  Refreshments

11:00-12:30  Session 14: Negation and Extensions
Chair: François Fages

11:00  Pedro Cabalar, U Corunna, Spain
A rewriting method for well-founded semantics with explicit negation
11:30  Grigoris Antoniou, U Bremen, Germany and Michael Maher, Loyola U Chicago, USA
Embedding defeasible logic into logic programs
12:00  David Pearce, European Commission, Belgium; Vladimir Sarsakov, U Potsdam, Germany; Torsten Schaub, U Potsdam, Germany; Hans Tompits, Vienna U of Techn., Austria; and Stefan Woltran, Vienna U of Techn., Austria
A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report

12:30-14:00  Lunch

14:00-15:30  Session 15: Invited Tutorial

14:00  Abhik Roychoudhury, National U of Singapore and I. V. Ramakrishnan, State U of New York-Stony Brook, USA
Invited tutorial: Program transformations for automated verification

15:30-16:00  Refreshments

16:00-17:30  Session 16: Applications II
Chair: Gopal Gupta

16:00  Henrik Bærbak Christensen, U Aarhus, Denmark
Using logic programming to detect activities in pervasive healthcare
16:30  Tamás Benkö, Péter Krauth, and Péter Szeredi; IQSOFT Intelligent Software, Hungary
A logic-based system for application integration
17:00  Michael Thielscher, Dresden U of Techn., Germany
Reasoning about actions with CHRs and finite domain constraints