Front matter
1-20
Representing Arithmetic Constraints with Finite Automata: An Overview
Bernard Boigelot and Pierre Wolper
281-296
Logic Databases on the Semantic Web: Challenges and Opportunities
Stefan Decker
69-105
An Abductive Approach for Analysing Event-Based Requirements Specifications
Alessandra Russo, Rob Miller, Bashar Nuseibeh and Jeff Kramer
71-82
Trailing Analysis for HAL
Tom Schrijvers, Maria García de la Banda and Bart Demoen
43-63
Access Control for Deductive Databases by Logic Programming
Steve Barker
23-30
Reasoning about Actions with CHRs and Finite Domain Constraints
Michael Thielscher
411-418
Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems
Alexander Bockmayr and Arnaud Courtois
405-410
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints
Giridhar Pemmasani, C. R. Ramakrishnan and I. V. Ramakrishnan
1-9
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
Witold Charatonik, Supratik Mukhopadhyay and Andreas Podelski
130-147
A Model Theoretic Semantics for Multi-level Secure Deductive Databases
Hasan M. Jamil and Gillian Dobbie
148-163
Propagation Completeness of Reactive Constraints
Michael J. Maher
117-160
On Enabling the WAM with Region Support
Henning Makholm and Konstantinos Sagonas
322-344
A Different Look at Garbage Collection for the WAM
Bart Demoen
297-321
Copying Garbage Collection for the WAM: To Mark or Not to Mark?
Bart Demoen, Phuong-Lan Nguyen and Ruben Vandeginste
31-42
Logical Algorithms
Harald Ganzinger and David McAllester
1159-1210
Logical Loops
Joachim Schimpf
345-355
Learning in Logic with RichProlog
Eric Martin, Phuong Nguyen, Arun Sharma and Frank Stephan
255-270
Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification
François Bry and Sebastian Schaffert
83-94
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming
Brigitte Pientka
1372-1455
Proving the Equivalence of CLP Programs
Sorin Craciunescu
231-250
A Purely Logical Account of Sequentiality in Proof Search
Paola Bruscoli
11-22
Disjunctive Explanations
Katsumi Inoue and Chiaki Sakama
333-347
Reasoning with Infinite Stable Models II: Disjunctive Programs
Piero A. Bonatti
217-230
Computing Stable Models: Worst-Case Performance Estimates
Zbigniew Lonc and Mirosław Truszczyński
101-106
Towards Local Search for Answer Sets
Yannis Dimopoulos and Andreas Sideris
355-372
A Rewriting Method for Well-Founded Semantics with Explicit Negation
Pedro Cabalar
107-115
Embedding Defeasible Logic into Logic Programs
Grigoris Antoniou and Michael J. Maher
386-404
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits and Stefan Woltran
185-199
Using Logic Programming to Detect Activities in Pervasive Healthcare
Henrik Bærbak Christensen
263-281
Logic Programming for Software Engineering: A Second Chance
Kung-Kiu Lau and Michel Vanden Bossche
565-609
A Logic-Based System for Application Integration
Tamás Benkő, Péter Krauth and Péter Szeredi
95-100
The Limits of Horn Logic Programs
Shilong Ma, Yuefei Sui and Ke Xu
74-103
Multi-adjoint Logic Programming: A Neural Net Approach
Jesús Medina, Enrique Mérida-Casermeiro and Manuel Ojeda-Aciego
419-435
Fuzzy Prolog: A Simple General Implementation Using CLP(
R
\mathcal{R}
)
Claudio Vaucheret, Sergio Guadarrama and Susana Muñoz
173-185
Automated Analysis of CLP(FD) Program Execution Traces
Mireille Ducassé and Ludovic Langevine
373-386
Schema-Based Transformations of Logic Programs in λProlog
Petr Olmer and Petr Štěpánek
473-474
Non-uniform Hypothesis in Deductive Databases with Uncertainty
Yann Loyer and Umberto Straccia
475
Probabilistic Finite Domains: A Brief Overview
Nicos Angelopoulos
476
Modelling Multi-agent Reactive Systems
Prahladavaradan Sampath
65-70
Integrating Planning, Action Execution, Knowledge Updates and Plan Modifications via Logic Programming
Hisashi Hayashi, Kenta Cho and Akihiko Ohsuga
200-217
A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs
Gérard Ferrand and Arnaud Lallouet
1-10
TCLP: Overloading, Subtyping and Parametric Polymorphism Made Practical for CLP
Emmanuel Coquery and François Fages
161-174
Logical Grammars Based on Constraint Handling Rules
Henning Christiansen
251-263
Debugging in A-Prolog: A Logical Approach
Mauricio Osorio, Juan Antonio Navarro and José Arrazola
Back matter