20. ICLP 2004: Saint Malo, France

Invited Talks

• Nachum Dershowitz:
  Termination by Abstraction. 1-18
  
• Michael Gelfond:
  Answer Set Programming and the Design of Deliberative Agents. 19-26
  

Analysis

• John P. Gallagher, Kim S. Henriksen:
  Abstract Domains Based on Regular Types. 27-42
  
• Jan-Georg Smaus:
  Termination of Logic Programs Using Various Dynamic Selection Rules. 43-57
  
• Tom Schrijvers, Alexander Serebrenik:
  Improving Prolog Programs: Refactoring for Prolog. 58-72
  

Constraints I

• Islam Elkabani, Enrico Pontelli, Tran Cao Son:
  Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP. 73-89
  
• Gregory J. Duck, Peter J. Stuckey, Maria J. García de la Banda, Christian Holzbaur:
  The Refined Operational Semantics of Constraint Handling Rules. 90-104
  
• Gregory J. Duck, Maria J. García de la Banda, Peter J. Stuckey:
  Compiling Ask Constraints. 105-119
  
• Tom Schrijvers, David Scott Warren:
  Constraint Handling Rules and Tabled Execution. 120-136
  

Alternative Paradigms I

• Alex Dekhtyar, Michael I. Dekhtyar:
  Possible Worlds Semantics for Probabilistic Logic Programs. 137-148
  
• Patrick Caldon, Eric Martin:
  Limiting Resolution: From Foundations to Implementation. 149-164
  
• Oliver Ray, Krysia Broda, Alessandra Russo:
  Generalised Kernel Sets for Inverse Entailment. 165-179
  

Answer Set Programming I

• Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir:
  On Programs with Linearly Ordered Multiple Preferences. 180-194
  
• Joost Vennekens, David Gilis, Marc Denecker:
  Splitting an Operator. 195-209
  
• David Pearce:
  Simplifying Logic Programs Under Answer Set Semantics. 210-224
  
• Thomas Linke, Hans Tompits, Stefan Woltran:
  On Acyclic and Head-Cycle Free Nested Logic Programs. 225-239
  

Implementation

• Remko Tronçon, Gerda Janssens, Henk Vandecasteele:
  Fast Query Evaluation with (Lazy) Control Flow Compilation. 240-253
  
• Ricardo Rocha, Fernando M. A. Silva, Vítor Santos Costa:
  Speculative Computations in Or-Parallel Tabled Logic Programs. 254-268
  
• James Cheney, Christian Urban:
  alpha-Prolog: A Logic Programming Language with Names, Binding and a-Equivalence. 269-283
  
• Susana Muñoz-Hernández, Juan José Moreno-Navarro:
  Implementation Results in Classical Constructive Negation. 284-298
  

Constraints II

• Eric Monfroy, Frédéric Saubion, Tony Lambert:
  On Hybridization of Local Search and Constraint Propagation. 299-313
  
• Jia-Huai You, Guiwen Hou:
  Arc-Consistency + Unit Propagation = Lookahead. 314-328
  
• Nicolas Beldiceanu, Emmanuel Poder:
  The period Constraint. 329-342
  
• Camilo Rueda, Frank D. Valencia:
  Non-viability Deductions in Arc-Consistency Computation. 343-355
  

Answer Set Programming II

• Toshiko Wakaki, Katsumi Inoue:
  Compiling Prioritized Circumscription into Answer Set Programming. 356-370
  
• Chiara Cumbo, Wolfgang Faber, Gianluigi Greco, Nicola Leone:
  Enhancing the Magic-Set Method for Disjunctive Datalog Programs. 371-385
  
• Esra Erdem, Martin D. F. Wong:
  Rectilinear Steiner Tree Construction Using Answer Set Programming. 386-399
  
• Xiumei Jia, Jia-Huai You, Li-Yan Yuan:
  Adding Domain Dependent Knowledge into Answer Set Programs for Planning. 400-415
  

Alternative Paradigms II

• David Robertson:
  Multi-agent Coordination as Distributed Logic Programming. 416-430
  
• Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe:
  Logic Programs with Annotated Disjunctions. 431-445
  

Poster Presentations

• Elvira Albert, Germán Puebla, Manuel V. Hermenegildo:
  Abstract Interpretation-Based Mobile Code Certification. 446-447
  
• Steve Barker:
  Labeled Logic Programs. 448-449
  
• François Bry, Paula-Lavinia Patranjan, Sebastian Schaffert:
  Xcerpt and XChange - Logic Programming Languages for Querying and Evolution on the Web. 450-451
  
• Alessandro Dal Palù, Agostino Dovier, Federico Fogolari:
  Protein Folding Simulation in CCP. 452-453
  
• Olivier Defour, Jean-Marc Jézéquel, Noël Plouzeau:
  Applying CLP to Predict Extra-Functional Properties of Component-Based Models. 454-455
  
• Pierre Deransart:
  Main Results of the OADymPPaC Project. 456-457
  
• Dávid Hanák, Tamás Szeredi, Péter Szeredi:
  FDBG, the CLPFD Debugger Library of SICStus Prolog. 458-459
  
• Rohit N. Kundaji, R. K. Shyamasundar:
  Development of Semantic Debuggers Based on Refinement Calculus. 460-461
  
• Ludovic Langevine, Mireille Ducassé:
  A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer. 462-463
  
• Massimo Marchi, Alessandra Mileo, Alessandro Provetti:
  Grid Service Selection with PPDL. 464-466
  
• Moritz Neugebauer:
  Concurrent Constraint Programming and Tree-Based Acoustic Modelling. 467-468
  
• Linh Anh Nguyen:
  MProlog: An Extension of Prolog for Modal Logic Programming. 469-470
  
• Matthieu Petit, Arnaud Gotlieb:
  Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing. 471-472
  
• Rafael Ramirez, Juanjo Martinez:
  Constraint-Based Synchronization and Verification of Distributed Java Programs. 473-474
  
• Tom Schrijvers:
  JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR. 475-476
  
• Paul Tarau:
  Agent Oriented Logic Programming Constructs in Jinni 2004. 477-478
  

Last update Wed May 22 06:47:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page