25. ICLP 2009: Pasadena, CA, USA

Invited Talks

• Chris Mungall:
  Experiences Using Logic Programming in Bioinformatics. 1-21
  
• Marc Denecker:
  A Knowledge Base System Project for FO(.). 22
  
• Paulo Moura:
  From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse. 23
  
• Taisuke Sato:
  Generative Modeling by PRISM. 24-35
  

Tutorials

• Jan Wielemaker:
  Enabling Serendipitous Search on the Web of Data Using Prolog. 36
  
• Andy King:
  Untangling Reverse Engineering with Logic and Abstraction. 37
  
• Mireille Ducassé:
  (C)LP Tracing and Debugging. 38
  
• Luc De Raedt:
  Probabilistic Logic Learning - A Tutorial Abstract. 39
  

Best Papers

• Matthias Broecheler, Gerardo I. Simari, V. S. Subrahmanian:
  Using Histograms to Better Answer Queries to Probabilistic Logic Programs. 40-54
  
• Henning Christiansen, John P. Gallagher:
  Non-discriminating Arguments and Their Uses. 55-69
  

Applications I

• Henning Christiansen, Ole Torp Lassen:
  Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis. 70-83
  
• Phan Minh Dung, Do Duc Hanh, Phan Minh Thang:
  Stabilization of Information Sharing for Queries Answering in Multiagent Systems. 84-98
  
• Tran Cao Son, Enrico Pontelli, Chiaki Sakama:
  Logic Programming for Multiagent Planning with Negotiation. 99-114
  

Implementation I

• Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
  Answer Set Programming with Constraints Using Lazy Grounding. 115-129
  
• Xiaoping Chen, Jianmin Ji, Fangzhen Lin:
  Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs. 130-144
  

Theory

• Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner:
  Modular Nonmonotonic Logic Programming Revisited. 145-159
  
• James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
  Merging Logic Programs under Answer Set Semantics. 160-174
  
• Miroslaw Truszczynski:
  Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs. 175-189
  

Implementation II

• Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo:
  A Tabling Implementation Based on Variables with Multiple Bindings. 190-204
  
• Jorge Costa, João Raimundo, Ricardo Rocha:
  A Term-Based Global Trie for Tabled Logic Programs. 205-219
  

Analysis

• Dean Voets, Danny De Schreye:
  A New Approach to Non-termination Analysis of Logic Programs. 220-234
  

Constraints I

• Martin Gebser, Max Ostrowski, Torsten Schaub:
  Constraint Answer Set Solving. 235-249
  
• Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub:
  On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers. 250-264
  

System and Tool Descriptions

• Michael P. Ashley-Rollman, Peter Lee, Seth Copen Goldstein, Padmanabhan Pillai, Jason Campbell:
  A Language for Large Ensembles of Independently Executing Nodes. 265-280
  
• Edison Mera, Pedro López-García, Manuel V. Hermenegildo:
  Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework. 281-295
  
• Johan Wittocx, Hanne Vlaeminck, Marc Denecker:
  Debugging for Model Expansion. 296-311
  

Applications II

• Torsten Schaub, Sven Thiele:
  Metabolic Network Expansion with Answer Set Programming. 312-326
  
• Michael Thielscher:
  Answer Set Programming for Single-Player Games in General Game Playing. 327-341
  
• Thomas Eiter, Esra Erdem, Halit Erdogan, Michael Fink:
  Finding Similar or Diverse Solutions in Answer Set Programming. 342-356
  

Implementation III

• Beata Sarna-Starosta, Tom Schrijvers:
  Attributed Data for CHR Indexing. 357-371
  
• David Vaz, Vítor Santos Costa, Michel Ferreira:
  User Defined Indexing. 372-386
  

Constraints II

• Marco Gavanelli, Marco Alberti, Evelina Lamma:
  Integration of Abductive Reasoning and Constraint Optimization in SCIFF. 387-401
  
• Neng-Fa Zhou:
  Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC. 402-416
  
• Thomas Hildebrandt, Hugo A. López:
  Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming. 417-431
  

Probability, Uncertainty

• Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul Fodor, Senlin Liang:
  Logic Programming with Defaults and Argumentation Theories. 432-448
  
• Rafael Caballero, Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz:
  Qualified Computations in Functional Logic Programming. 449-463
  
• Steffen Hölldobler, Carroline Dewi Puspa Kencana Ramli:
  Logic Programs under Three-Valued Lukasiewicz Semantics. 464-478
  

Short Papers

• Leslie De Koninck:
  Execution Control for CHR. 479-483
  
• Leslie De Koninck, Gregory J. Duck, Peter J. Stuckey:
  Demand-Driven Normalisation for ACD Term Rewriting. 484-488
  
• Yuliya Lierler, Vladimir Lifschitz:
  One More Decidable Class of Finitely Ground Programs. 489-493
  
• Jon Sneyers:
  Optimizing Compilation and Computational Complexity of Constraint Handling Rules. 494-498
  
• Paolo Pilozzi, Danny De Schreye:
  Proving Termination by Invariance Relations. 499-503
  
• Paolo Pilozzi, Danny De Schreye:
  Automating Termination Proofs for CHR. 504-508
  
• Jesús Aranda, Gérard Assayag, Carlos Olarte, Jorge A. Pérez, Camilo Rueda, Mauricio Toro, Frank D. Valencia:
  An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems. 509-513
  
• Terrance Swift:
  An Engine for Computing Well-Founded Models. 514-518
  
• Terrance Swift, Alexandre Miguel Pinto, Luís Moniz Pereira:
  Incremental Answer Completion in the SLG-WAM. 519-524
  

Doctoral Consortium

• Paul Fodor:
  Research Summary: Tabled Evaluation for Transaction Logic Programs. 525-526
  
• Michael P. Ashley-Rollman:
  Research Summary: Logic Programming for Massively Distributed Systems. 527-529
  
• Chendong Li:
  Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality. 530-531
  
• Jianmin Ji:
  Research Summary. 532-533
  
• Paolo Pilozzi:
  Research Summary: Termination of CHR. 534-535
  
• Alessio Paolucci:
  Research Summary: Intelligent Natural Language Processing Techniques and Tools. 536-537
  
• Gerardo I. Simari:
  Stochastic Reasoning with Models of Agent Behavior. 538-539
  
• Frank Raiser:
  Research Summary. 540-541
  
• Daniela Inclezan:
  Modular Action Language ALM{\cal ALM}. 542-543
  
• Yana Todorova:
  Answering Questions from Natural Language Using A-Prolog. 544-546
  
• Hui Wan:
  Belief Logic Programming. 547-548
  
• Christian Theil Have:
  Logic-Statistic Models with Constraints for Biological Sequence Analysis. 549-550
  
• Mantas Simkus:
  Fusion of Logic Programming and Description Logics. 551-552
  
• Dean Voets:
  Research Summary: Non-termination Analysis of Logic Programs. 553-554
  
• Gayathri Namasivayam:
  Study of Random Logic Programs. 555-556
  
• Michael De Rosa:
  Locally Distributed Predicates: A Programming Facility for Distributed State Detection. 557-558
  
• Paola Campli, Stefano Bistarelli:
  Capturing Fair Computations on Concurrent Constraint Language. 559-560
  
• Marco Bottalico, Stefano Bistarelli:
  Constraint Based Languages for Biological Reactions. 561-562