ICLP2009: Accepted papers

---

Accepted Papers

• Leslie De Koninck. Execution control for Constraint Handling Rules – PhD Summary
• Beata Sarna-Starosta and Tom Schrijvers. Attributed Data for CHR Indexing
• Johan Wittocx, Hanne Vlaeminck and Marc Denecker. Debugging for Model Expansion
• Martin Gebser, Max Ostrowski and TorstenSchaub. Constraint Answer Set Solving
• TorstenSchaub and Sven Thiele. Metabolic Network Expansion with Answer Set Programming
• James Delgrande, TorstenSchaub, Hans Tompits and Stefan Woltran. Merging Logic Programs under Answer Set Semantics
• Martin Gebser, Roland Kaminski, Benjamin Kaufmann and TorstenSchaub. On the Implementation of Weight Constraint Rules in Conflict-driven ASP Solvers
• Matthias Broecheler, Gerardo Simari and V.S. Subrahmanian. Using Histograms to Better Answer Queries to Probabilistic Logic Programs
• MirekTruszczynski. Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Leslie De Koninck, Gregory Duck and Peter Stuckey. Demand Driven Normalisation for ACD Term Rewriting
• Yuliya Lierler and Vladimir Lifschitz. One More Decidable Class of Finitely Ground Programs
• Michael Thielscher. Answer Set Programming for Single-Player Games in General Game Playing
• Jorge Costa, João Raimundo and Ricardo Rocha. A Term-Based Global Trie for Tabled Logic Programs
• HuiWan, Benjamin Grosof, Michael Kifer, Paul Fodor and SenlinLiang. Logic Programming with Defaults and Argumentation Theories
• Jon Sneyers. Optimizing Compilation and Computational Complexity of Constraint Handling Rules – Ph.D. thesis summary
• Rafael Caballero, Mario Rodríguez-Artalejo and Carlos A. Romero-Díaz. Qualified Computations in Functional Logic Programming
• Steffen Hölldobler and Carroline Kencana Ramli. Logic Programs under Three-Valued Lukasiewicz Semantics
• Paolo Pilozzi and Daniel De Schreye. Proving termination by invariance relations
• Paolo Pilozzi and Daniel De Schreye. Automating termination proofs for CHR
• Minh Dao-Tran, Thomas Eiter, Michael Fink and Thomas Krennwallner. Modular Nonmonotonic Logic Programming Revisited
• Henning Christiansen and John Gallagher. Non-discriminating Arguments and their Uses
• Jesus Aranda, Gerard Assayag, Carlos Olarte, Jorge A. Perez, Camilo Rueda, Mauricio Toro and Frank D. Valencia. An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems
• Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli and Gianfranco Rossi. Answer Set Programming with Constraints using Lazy Grounding
• Dean Voets and Daniel De Schreye. A new approach to non-termination analysis of Logic Programs
• Marco Gavanelli, Marco Alberti and Evelina Lamma. Integration of abductive reasoning and constraint optimization in SCIFF
• Michael Ashley-Rollman, Padmanabhan Pillai, Seth Goldstein, Peter Lee and Jason Campbell. Meld: A Language for Programming Large Ensembles of Independently Executing Nodes
• Henning Christiansen and Ole TorpLassen. Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
• Phan Minh Dung, Do Duc Hanh and Phan Minh Thang. Stabilization of Information Sharing for Queries Answering in Multiagent Systems
• Edison Mera, Pedro Lopez-Garcia and Manuel Hermenegildo. Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework
• Pablo Chico de Guzmán, Manuel Carro and Manuel Hermenegildo. A Tabling Implementation Based on Variables with Multiple Bindings
• Thomas Eiter, EsraErdem, HalitErdogan and Michael Fink. Finding Similar or Diverse Solutions in Answer Set Programming
• Neng-Fa Zhou. Encoding Table Constraints in CLP(FD) Based on Pair-wise AC
• Tran Cao Son, EnricoPontelli and Chiaki Sakama. Logic Programming for Multiagent Planning with Negotiation
• David Vaz, Vítor Santos Costa and Michel Ferreira. User Defined Indexing
• Terrance Swift. An Engine for Computing Well-Founded Models
• Terrance Swift, Alexandre Miguel Pinto and Luis Moniz Pereira. Incremental Answer Completion in XSB-Prolog
• Xiaoping Chen, Jianmin Ji and Fangzhen Lin. Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
• Thomas Hildebrandt and Hugo Andres Lopez. Types for Secure Pattern Matching with Local  Knowledge in Universal Concurrent Constraint  Programming

---

10th International Conference on Logic Programming and Nonmonotonic Reasoning

---

Accepted Technical Papers

• Michael Thomas. The Complexity of Circumscriptive Inference in Post’s Lattice
• Jos de Bruijn and Stijn Heymans. Complexity of the Stable Model Semantics for Queries on Incomplete Databases
• Miroslaw Truszczynski. Trichotomy results for reasoning with disjunctive logic
• Claire Lefèvre and Pascal Nicolas. A First Order Forward Chaining Approach for Answer Set Computing
• Jörg Pührer and Hans Tompits. Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Antonis Bikakis and Grigoris Antoniou. Argumentation about Context in Ambient Intelligence
• Wolfgang Faber and Stefan Woltran. Manifold Answer-Set Programs for Meta-Reasoning
• Marcello Balduccini. Splitting a CR-Prolog Program
• Marcello Balduccini. How Flexible Is Answer Set Programming? An Experiment in Formalizing Common-sense in ASP
• Yisong Wang, Jia-Huai You and Mingyi Zhang. Weight Constraint Programs with Functions
• Yi-Dong Shen and Jia-Huai You. A Default Approach to Semantics of Logic Programs with Constraint Atoms
• Gerhard Brewka and Thomas Eiter. Argumentation Context Systems: A Framework for Abstract Group Argumentation
• Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen and Ilkka Niemelä. A Module-Based Framework for Multi-Language Constraint Modeling
• Reinhard Pichler, Stefan Ruemmele and Stefan Woltran. Belief Revision with Bounded Treewidth
• Emilia Oikarinen and Matti Järvisalo. Max-ASP: Maximum Satisfiability of Answer Set Programs
• Gayathri Namasivayam and Mirek Truszczynski. Simple Random Logic Programs
• Pedro Cabalar, David Pearce and Agustín Valverde. A revised concept of safety for general answer set programs
• Tim Kimber, Krysia Broda and Alessandra Russo. Induction on Failure: Learning Connected Horn Theories
• Minh Dao-Tran, Thomas Eiter, Michael Fink and Thomas Krennwallner. Relevance-driven Evaluation of Modular Nonmonotonic Logic Programs
• Ping Hou and Marc Denecker. A Deductive System for FO(ID) Based on Least Fixpoint Logic
• Francesco Calimeri, Susanna Cozza, Giovambattista Ianni and Nicola Leone. Magic Sets for the Bottom-up Evaluation of Finitely Recursive Programs
• Tomi Janhunen, Ilkka Niemelä and Mark Sevalnev. Computing Stable Models via Reductions to Difference Logic
• Joohyung Lee and Yunsong Meng. On Reductive Semantics of Aggregates in Answer Set Programming
• Loizos Michael and Antonis Kakas. Knowledge Qualification through Argumentation
• Hui Wan and Michael Kifer. Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence

Accepted Application Papers

• James Delgrande, Torsten Grote and Aaron Hunter. A General Approach to the Verification of Cryptographic Protocols using Answer Set Programming
• Johannes Oetsch, Martina Seidl, Hans Tompits and Stefan Woltran. ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions
• Salvatore Maria Ielpa, Salvatore Iiritano, Nicola Leone and Francesco Ricca. An ASP-Based System for e-Tourism
• Ozan Caldiran, Kadir Haspalamutgil, Abdullah Ok, Can Palaz, Esra Erdem and Volkan Patoglu. Bridging the Gap between High-Level Reasoning and Low-Level Control

Accepted Short Technical Papers

• Vernon Asuncion and Yan Zhang. Translating Preferred Answer Set Programs to Propositional Logic
• Marcello Balduccini. CR-Prolog as a Specification Language for Constraint Satisfaction Problems
• Luis Moniz Pereira and Alexandre Miguel Pinto. Layer Supported Models of Logic Programs
• Guohua Liu. Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
• Chiaki Sakama. Social Default Theories
• Agostino Dovier, Andrea Formisano and Enrico Pontelli. Representing Multi-Agent Systems in CLP
• Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca Pozzato. Prototypical reasoning with low complexity Description Logics: typicality in EL?
• Luke Hopton, Owen Cliffe, Marina De Vos and Julian Padget. AQL: A Query Language for Action Domains Modelled using Answer Set Programming
• Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano and Francesco Pagano. Applying ASP to UML model validation.
• Duygu Cakmak, Esra Erdem and Halit Erdogan. Computing weighted solutions in answer set programming
• Chitta Baral, Tran Son and Enrico Pontelli. Modeling Multi-Agent Domains in an Action Languages: an Empirical Study using C
• Mauricio Osorio Galindo and Simone Pascucci. The Logical Consequence Role in LPNMR: a Parameterized Computation Approach

Accepted Application Papers

• Viren Kumar and James Delgrande. Using ASP To Solve the Multicore Scheduling Problem
• Salvatore Iiritano, Nicola Leone and Francesco Ricca. Some DLV Applications for Knowledge Management
• Harold Ishebabi, Philipp Mahr, Christophe Bobda, Martin Gebser and Torsten Schaub. Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs

Accepted System Descriptions

• Marc Finthammer, Christoph Beierle, Benjamin Berger and Gabriele Kern-Isberner. An Implementation of Belief Change Operations Based on Probabilistic Conditional Logic
• Claire Lefèvre and Pascal Nicolas. The First Version of a new ASP Solver : ASPeRiX
• Enrico Ellguth, Martin Gebser, Markus Gusowski, Benjamin Kaufmann, Roland Kaminski, Stefan Liske, Torsten Schaub, Lars Schneidenbach and Bettina Schnor. A Simple Distributed Conflict-Driven Answer Set Solver
• Martin Gebser, Roland Kaminski, Max Ostrowski, Torsten Schaub and Sven Thiele. On the Input Language of ASP Grounder Gringo
• Martin Gebser, Benjamin Kaufmann and Torsten Schaub. The Conflict-Driven Answer Set Solver clasp: Progress Report
• Annamaria Bria, Wolfgang Faber and Nicola Leone. nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver
• Nicola Leone, Francesco Ricca and Giorgio Terracina. An ASP-Based Data Integration System
• Victor Noel and Antonis Kakas. Gorgias-C: Extending Argumentation with Constraint Solving
• Joohyung Lee and Ravi Palla. System F2LP – Computing Answer Sets of First-Order Formulas
• Francesco Calimeri, Susanna Cozza, Giovambattista Ianni and Nicola Leone. An ASP System with Functions, Lists, and Sets

Accepted Application Summaries

• Georg Boenn, Martin Brain, Marina De Vos and John ffitch. ANTON: Composing Logic and Logic Composing
• Tom Crick, Marina De Vos, Martin Brain and John Fitch. Generating Optimal Code using Answer Set Programming
• Owen Cliffe, Marina De Vos and Julian Padget. Modelling Normative Frameworks using Answer Set Programing
• Esra Erdem, Ozan Erdem and Ferhan Ture. HAPLO-ASP: Haplotype Inference using Answer Set Programming
• Esra Erdem. PHYLO-ASP: Phylogenetics using Answer Set Programming
• Francois Gagnon and Babak Esfandiari. Using Answer Set Programming to Enhance Operating System Discovery
• Alessandra Mileo, Davide Merico and Roberto Bisiani. Non-monotonic reasoning and Wireless Sensor Networks for Secure and Independent Living: the SINDI system
• Alessandro Dal Palù, Agostino Dovier and Enrico Pontelli. Logic Programming Techniques in Protein Structure Determination: Methodologies and Results

---

---

Accepted Papers

• Gabriel Aranda-López, Susana Nieva, Fernando Sáenz-Pérez and Jaime Sánchez-Hernández. Implementing a Fixed Point Semantics for a Constraint Deductive Database
• Nick Benton, Lennart Beringer, Martin Hofmann and Andrew Kennedy. Relational semantics for effect-based program transformations: higher-order store
• Rafael del Vado Vírseda. A Higher-Order Logical Framework for the Algorithmic Debugging and Verification of Declarative Programs
• Ezra Cooper and Philip Wadler. The RPC Calculus
• Wolfgang Dvorak, Georg Gottlob, Reinhard Pichler and Stefan Woltran. Alternation as a Programming Paradigm
• Christos Dimoulas, Riccardo Pucella and Matthias Felleisen. Future Contracts
• Malgorzata Biernacka and Dariusz Biernacki. Context-based proofs of termination for typed delimited-control operators
• Pascual Julián-Iranzo and Clemente Rubio-Manzano. A Declarative Semantics for Bousi~Prolog
• Moreno Falaschi, Carlos Olarte and Catuscia Palamidessi. A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs
• Giuseppe Castagna, Mariangiola Dezani, Elena Giachino and Luca Padovani. Foundations of Session Types
• Vivek Nigam and Dale Miller. Algorithmic specifications in linear logic with subexponentials
• Michael Codish, Samir Genaim and Peter Stuckey. A Declarative Encoding of Telecommunications Feature Subscription in SAT
• Sergio Antoy and Michael Hanus. Set Functions for Functional Logic Programming
• Quan Phan and Gerda Janssens. Path-sensitive region analysis for Mercury programs
• Silvia Clerici and Cristina Zoltan. A Dynamically Customizable Process-centered Evaluation Model
• Paul Tarau. An Embedded Declarative Data Transformation Language
• Hai-Feng Guo, Wen Zheng and Mahadevan Subramaniam. L2C2: Logic-based LSC Consistency Checking
• Kenny Zhu, Daniel Dantas, Kathleen Fisher, Limin Jia, Yitzhak Mandelbaum, Vivek Pai and David Walker. Language Support for Processing Distributed Ad Hoc Data
• Naoki Kobayashi. Model-Checking Higher-Order Functions
• Hiroshi Unno and Naoki Kobayashi. Dependent Type Inference with Interpolants
• Maurizio Gabbrielli, Maria Chiara Meo and Jacopo Mauro. On the expressive power of priorities in CHR
• Markus Kaiser and Ralf Laemmel. An Isabelle/HOL-based model of Stratego-like traversal strategies
• Hanne Vlaeminck, Joost Vennekens and Marc Denecker. A Logical Framework for Configuration Software
• Konstantinos Sagonas and Thanassis Avgerinos. Automatic Refactoring of Erlang Programs
• Amy Felty and Alberto Momigliano. Reasoning with Hypothetical Judgments and Open Terms in Hybrid
• Carl Eastlund and Matthias Felleisen. Making Induction Manifest in Modular ACL2

---

---

Accepted Papers

• Yan Wang and Veronica Gaspes. A Domain-Specific Language Approach to Protocol Stack Implementation.
• Rui Marques and Terrance Swift. A Simple and Efficient Implementation of Concurrent Local Tabling.
• Meera Sridhar and Kevin Hamlen. ActionScript In-lined Reference Monitoring in Prolog.
• Giovanni Grasso, Salvatore Iiritano, Nicola Leone, Francesco Ricca and Vincenzino Lio. An ASP-based System for Team-building in the Gioia-Tauro Seaport.
• Michael Hanus and Sven Koschnicke. An ER-based Framework for Declarative Web Programming.
• Miguel Areias and Ricardo Rocha. An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives.
• Hai Liu and Paul Hudak. An Ode to Arrows.
• Ashish Agarwal, Sooraj Bhat, Alexander Gray and Ignacio Grossmann. Automating Mathematical Program Transformations.
• João Raimundo and Ricardo Rocha. Compact Lists for Tabled Evaluation.
• Mathieu Boespflug. Conversion by Evaluation.
• Nicola Leone, Francesco Ricca and Terracina Giorgio. Efficient Application of Answer Set Programming for Advanced Data Integration.
• José Iborra. Explicitly Typed Exceptions for Haskell.
• Roly Perera. First-order interactive programming.
• Ana Sofia Gomes, Jose Julio Alferes and Terrance Swift. Implementing Query Answering for Hybrid MKNF Knowledge Bases.
• Rahmatullah Hafiz and Richard A. Frost. Lazy Combinators for Executable Specifications of General Attribute Grammars.
• Neil C.A. Moore, Ian P. Gent and Ian Miguel. Lazy explanations for constraint propagators.
• Stephane Grumbach and Fang Wang. Netlog, a Rule-based Language for Distributed Programming.
• Vítor Santos Costa. On the implementation of the CLP(BN) Language.
• Gonçalo Lopes and Luís Moniz Pereira. Prospective Storytelling Agents.
• Huiqing Li and Simon Thompson. Similar Code Detection and Elimination for Erlang Programs.
• Mischa Dieterle, Thomas Horstmeyer and Rita Loogen. Skeleton Composition using Remote Data.
• Maria Christakis and Konstantinos Sagonas. Static Detection of Race Conditions in Erlang.

---

---

Accepted Papers

• Florian Haftmann and Tobias Nipkow. Code Generation via Higher-Order Rewrite Systems
• Daniel Seidel and Janis Voigtländer. Automatically Generating Counterexamples to Naive Free Theorems
• Gilles Barthe, Pablo Buiras and César Kunz. A Functional Framework for Result Checking
• Martin Avanzini and Georg Moser. Complexity Analysis by Graph Rewriting
• Jacob Howe and Andy King. A Pearl on SAT Solving in Prolog
• Jeroen Ketema and Jakob Grue Simonsen. Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and Lambda Calculus
• Dominic Orchard and Tom Schrijvers. Haskell Type Constraints Unleashed
• Vicent Estruch, Cèsar Ferri, José Hernández-Orallo and M.José Ramírez-Quintana. An Integrated Distance for Atoms
• Stefano Berardi and Makoto Tatsuta. Internal Normalization, Compilation and Decompilation for System F
• Yolanda García-Ruiz, Rafael Caballero and Fernando Sáenz-Pérez. Applying Constraint Logic Programming to SQL Test Case Generation
• Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh and Nicolas Oury. ??: Dependent Types Without the Sugar
• Peter Thiemann and Martin Sulzmann. Tagfree Combinators for Binding-Time Polymorphic Program Generation
• Oleg Kiselyov. Delimited Control in OCaml, Abstractly and Concretely. System Description
• Javier Álvez and Francisco Javier López-Fraguas. A Complete Axiomatization of Strict Equality over Infinite Trees
• Didier Remy and Boris Yakobowski. A Church-Style Intermediate Language for MLF
• Akimasa Morihata and Kiminori Matsuzaki. Automatic Parallelization of Recursive Functions using Quantifier Elimination
• Andreas Abel. Normalization by Evaluation for the beta-eta Calculus of Constructions
• Naoki Nishida and Masahiko Sakai. Proving Injectivity of Functions via Program Inversion in Term Rewriting
• Alexis Saurin. Standardization and Böhm trees for Lambda-mu-calculus.
• Mischa Dieterle, Jost Berthold and Rita Loogen. A Skeleton for Distributed Work Pools in Eden
• Olivier Danvy, Kevin Millikin, Johan Munk and Ian Zerny. Defunctionalized Interpreters for Call-by-Need Evaluation