ICLP accepted papers

Regular papers

Grigoris Antoniou, U Bremen, Germany and Michael Maher, Loyola U Chicago, USA
Embedding defeasible logic into logic programs

Steve Barker, U Westminster, UK
Access control for deductive databases by logic programming

Tamás Benkö, Péter Krauth, and Péter Szeredi; IQSOFT Intelligent Software, Hungary
A logic-based system for application integration

Alexander Bockmayr and Arnaud Courtois, LORIA Nancy, France
Using hybrid concurrent constraint programming to model dynamic biological systems

Piero A. Bonatti, U Milan, Italy
Reasoning with infinite stable models II: Disjunctive programs

Paola Bruscoli, Dresden U of Techn., Germany
A purely logical account of sequentiality in proof search

François Bry and Sebastian Schaffert, U Munich, Germany
Towards a declarative query and transformation language for XML and semistructured data: Simulation unification

Pedro Cabalar, U Corunna, Spain
A rewriting method for well-founded semantics with explicit negation

Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski; MPI Saarbrücken, Germany
Constraint-based infinite model checking and tabulation for stratified CLP

Henrik Bærbak Christensen, U Aarhus, Denmark
Using logic programming to detect activities in pervasive healthcare

Sorin Craciunescu, INRIA Rocquencourt, France
Proving the equivalence of CLP programs

Bart Demoen, K.U. Leuven, Belgium
A different look at garbage collection for the WAM

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 ?

Yannis Dimopoulos and Andreas Sideris, U Cyprus
Towards local search for answer sets

Harald Ganzinger, MPI Saarbrücken, Germany and David McAllester, AT&T Labs, USA
Logical algorithms

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

Hasan M. Jamil, Mississipi State U, USA and Gillian Dobbie, U Auckland, New Zealand
A model theoretic semantics for multi-level secure deductive databases

Kung-Kiu Lau, U Manchester, UK and Michel Vanden Bossche, Mission Critical, Belgium
Logic programming for software engineering: A second chance

Zbigniew Lonc, Warsaw U of Techn., Poland and Miroslaw Truszczynski, U Kentucky, USA
Computing stable models: Worst-case performance estimates

Michael Maher, Loyola U Chicago, USA
Propagation completeness of reactive constraints

Henning Makholm, U Copenhagen, Denmark and Kostis Sagonas, Uppsala U, Sweden
On enabling the WAM with region support

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

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

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

Brigitte Pientka, Carnegie Mellon U, USA
A proof-theoretic foundation for tabled higher-order logic programming

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

Joachim Schimpf, Imperial College, UK
Logical loops

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

Michael Thielscher, Dresden U of Techn., Germany
Reasoning about actions with CHRs and finite domain constraints


Nicos Angelopoulos, Imperial College, UK
Probabilistic finite domains: A brief overview

Henning Christiansen, U Roskilde, Denmark
Logical grammars based on constraint handling rules

Emmanuel Coquery and François Fages, INRIA Rocquencourt, France
TCLP: overloading, subtyping and parametric polymorphism made practical for CLP

Mireille Ducassé, IRISA Rennes, France and Ludovic Langevine, INRIA Rocquencourt, France
Automated analysis of CLP(FD) program execution traces

Gérard Ferrand and Arnaud Lallouet, U Orléans, France
A logic program characterization of domain reduction approximations in finite domain CSPs

Hisashi Hayashi, Kenta Cho, and Akihiko Ohsuga; Toshiba, Japan
Integrating planning, action execution, knowledge updates and plan modifications via logic programming

Yann Loyer and Umberto Straccia, CNR Pisa, Italy
Non-uniform hypothesis in deductive databases with uncertainty

Shilong Ma, Beijing U of Aeronautics and Astronautics, China; Yuefei Sui, Academia Sinica, China; and Ke Xu, Beijing U of Aeronautics and Astronautics, China
The limits of Horn logic programs

Jesús Medina, Enrique Mérida-Casermeiro, and Manuel Ojeda-Aciego; U Málaga, Spain
Multi-adjoint logic programming: a neural net approach

Petr Olmer and Petr Stepánek, Charles U, Czechia
Schema-based transformations of logic programs in λProlog

Mauricio Osorio, Juan Antonio Navarro, and José Arrazola; U the Americas, Mexico
Debugging in A-Prolog: A logical approach

Prahladavaradan Sampath, Teamphone.com, UK
Modelling multi-agent reactive systems

Claudio Vaucheret, Sergio Guadarrama, and Susana Muñoz; Techn. U of Madrid, Spain
Fuzzy Prolog: A simple general implementation using CLP(R)