26. ICLP 2010: Edinburgh, Scotland, UK

The regular papers of this conference are published in Theory and Practice of Logic Programming, Volume 10 (4-6)

• Manuel V. Hermenegildo, Torsten Schaub:
  Titlepage, Table of Contents, Conference Organization.
  
• Manuel V. Hermenegildo, Torsten Schaub:
  Introduction to the Technical Communications of the 26th International Conference on Logic Programming.
  
• Molham Aref:
  Datalog for Enterprise Software: from Industrial Applications to Research (Invited Talk). 1
  
• François Fages:
  A Logical Paradigm for Systems Biology (Invited Talk). 2-3
  
• Marco Alberti, Marco Gavanelli, Evelina Lamma:
  Runtime Addition of Integrity Constraints in an Abductive Proof Procedure. 4-13
  
• Marcello Balduccini:
  Learning Domain-Specific Heuristics for Answer Set Solvers. 14-23
  
• Selen Basol, Ozan Erdem, Michael Fink, Giovambattista Ianni:
  HEX Programs with Action Atoms. 24-33
  
• Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock:
  Communicating Answer Set Programs. 34-43
  
• Stefan Brass:
  Implementation Alternatives for Bottom-Up Evaluation. 44-53
  
• Domenico Corapi, Alessandra Russo, Emil Lupu:
  Inductive Logic Programming as Abductive Search. 54-63
  
• Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chris Cornelis, Martine De Cock:
  Efficient Solving of Time-dependent Answer Set Programs. 64-73
  
• Daan Fierens:
  Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization. 74-83
  
• Nicolas Guenot:
  Focused Proof Search for Linear Logic in the Calculus of Structures. 84-93
  
• Tomi Janhunen:
  Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. 94-103
  
• Pedro López-García, Luthfi Darmawan, Francisco Bueno:
  A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification. 104-113
  
• Michael J. Maher:
  Contractibility and Contractible Approximations of Soft Global Constraints. 114-123
  
• Theofrastos Mantadelis, Gerda Janssens:
  Dedicated Tabling for a Probabilistic Setting. 124-133
  
• Luís Moniz Pereira, Alexandre Miguel Pinto:
  Tight Semantics for Logic Programs. 134-143
  
• Joseph P. Near:
  From Relational Specifications to Logic Programs. 144-153
  
• Johannes Oetsch, Jörg Pührer, Hans Tompits:
  Methods and Methodologies for Developing Answer-Set Programs - Project Description. 154-161
  
• Fabrizio Riguzzi, Terrance Swift:
  Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. 162-171
  
• Jose Santos, Stephen Muggleton:
  Subsumer: A Prolog theta-subsumption engine. 172-181
  
• Paulo Shakarian, V. S. Subrahmanian, Maria Luisa Sapino:
  Using Generalized Annotated Programs to Solve Social Network Optimization Problems. 182-191
  
• Gerardo I. Simari, V. S. Subrahmanian:
  Abductive Inference in Probabilistic Logic Programs. 192-201
  
• Christoph Wernhard:
  Circumscription and Projection as Primitives of Logic Programming. 202-211
  
• Neda Saeedloei, Gopal Gupta:
  Timed Definite Clause Omega-Grammars. 212-221
  
• Abdulla Alqaddoumi:
  Towards a Parallel Virtual Machine for Functional Logic Programming. 222-225
  
• Mario Alviano:
  Dynamic Magic Sets for Disjunctive Datalog Programs. 226-235
  
• Andres A. Aristizabal P.:
  Bisimilarity in Concurrent Constraint Programming. 236-240
  
• Celine Dandois:
  Program analysis for code duplication in logic programs. 241-247
  
• Romain Demeyer:
  Program Analysis to Support Concurrent Programming in Declarative Languages. 248-254
  
• Christian Drescher:
  Constraint Answer Set Programming Systems. 255-264
  
• Sarah Alice Gaggl:
  Towards a General Argumentation System based on Answer-Set Programming. 265-269
  
• Hugo A. López:
  Models for Trustworthy Service and Process Oriented Systems. 270-276
  
• Thierry Martinez:
  Design and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints. 277-280
  
• Niels Pahlavi:
  Higher-order Logic Learning and lambda-Progol. 281-285
  
• Fabio Parisini:
  Local Branching in a Constraint Programming Framework. 286-288
  
• Neda Saeedloei:
  Logic Programming Foundations of Cyber-Physical Systems. 289-293
  
• Zachary Snow:
  Realizing the Dependently Typed Lambda Calculus. 294-299
  
• Mauricio Toro-Bermudez:
  Structured Interactive Musical Scores. 300-302
  
• Jakob Zwirchmayr:
  Cutting-Edge Timing Analysis Techniques. 303-305
  

Last update Fri May 25 08:19:41 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page