Invited Talks

• 
  Robin Milner: The Pi Calculus and Its Applications (Keynote Address). 3-4
• 
  Ken McAloon: Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming. 5-6
• 
  Nada Lavrac: Inductive Logic Programming for Relational Knowledge Discovery. 7-24

Refereed Papers

• 
  Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Co-definite Set Constraints with Membership Expressions. 25-39
• 
  Agostino Dovier, Carla Piazza, Gianfranco Rossi, Enrico Pontelli: On the Representation and Management of Finite Sets in CLP Languages. 40-54
• 
  Philippe Refalo: Meta-linear Constraints in Constraint Logic Programming. 55-69
• 
  Neng-Fa Zhou: A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints. 70-84
• 
  Kish Shen, Vítor Santos Costa, Andy King: Distance: A New Metric for Controlling Granularity for Parallel Execution. 85-99
• 
  Nuno A. Fonseca, Vítor Santos Costa, Inês de Castro Dutra: VisAll: A Universal Tool to Visualise Parallel Execution of Logic Programs. 100-114
• 
  Iliano Cervesato: Proof-Theoretic Foundation of Compilation in Logic Programming. 115-129
• 
  Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault: Abstract Compilation of lambda-Prolog. 130-144
• 
  Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Kyoung-Sun Kang: Efficient Implementation of a Linear Logic Programming Language. 145-159
• 
  Grigoris Antoniou, David Billington, Michael J. Maher: Normal Forms for Defeasible Logic. 160-174
• 
  Jia-Huai You, Li-Yan Yuan, Randy Goebel: Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure. 175-189
• 
  Sandro Etalle, Femke van Raamsdonk: Beyond Success and Failure. 190-205
• 
  Philippe Devienne, Anne Parrain, Patrick Taillibert, S. Varennes: Source-to-source Prolog Program Compression. 205-219
• 
  Michael Leuschel: Program Specialisation and Abstract Interpretation Reconciled. 220-234
• 
  Stefaan Decorte, Danny De Schreye: Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space. 235-249
• 
  Michael I. Dekhtyar, Alexander Ja. Dikovsky, Nicolas Spyratos: On Logically Justified Updates. 250-264
• 
  João Alexandre Leite, Luís Moniz Pereira: Iterated Logic Program Updates. 265-278
• 
  Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck: Specialising the Other Way Arond. 279-293
• 
  Sergio Greco, Carlo Zaniolo: Greedy Algorithms in Datalog with Choice and Negation. 294-309
• 
  Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan: On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. 310-324
• 
  Rachid Echahed, Jean-Christophe Janodet: Admissible Graph Rewriting and Narrowing. 325-342

Poster Abstracts

• 
  Antonis C. Kakas, A. Michael: Applications of Abductive Logic Programming. 343-344
• 
  Hélène Collavizza, François Delobel, Michel Rueher: Relationships between Partial Consistencies over Continuous Domains. 345-346
• 
  Michael Hanus, Frank Steiner: Controlling Search in Funtional Logic Programs. 347-348
• 
  Eric Monfroy: A Solver Collaboration in BALI. 349-350
• 
  Alvaro Ruiz-Andino, José J. Ruz: Integration of CLP and Stochastic Optimisation Strategies. 351-352
• 
  François Fages, Massimo Paltrinieri: A Generic Type System for CLP(chi). 353-354
• 
  Nicos Angelopoulos, Alessandra Di Pierro, Herbert Wiklicky: Implementing Randomised Algorithms in Constraint Logic Programming. 355-356
• 
  Gopal Gupta: Horn Logic Denotations. 357-358
• 
  Andreas Fordan, Roland H. C. Yap: Towards Early Projection in CLP(R). 359-360

last updated on Sat May 18 05:05:39 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page