List of 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 Torsten Schaub. Constraint Answer Set Solving

Torsten Schaub and Sven Thiele. Metabolic Network Expansion with Answer Set Programming

James Delgrande, Torsten Schaub, Hans Tompits and Stefan Woltran. Merging Logic Programs under Answer Set Semantics

Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. 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

Mirek Truszczynski. 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

Hui Wan, Benjamin Grosof, Michael Kifer, Paul Fodor and Senlin Liang. 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 Palu, 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 Torp Lassen. 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, Esra Erdem, Halit Erdogan 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, Enrico Pontelli 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