LPNMR 2011: Accepted papers

Long papers:
* Carlos Viegas Damásio and Joao Moura: Modularity of P-log programs
* Christian Drescher, Thomas Eiter, Michbaseael Fink, Thomas Krennwallner and Toby Walsh: Symmetry Breaking for Distributed Multi-Context Systems
* Ringo Baumann: Splitting an Argumentation Framework
* Martin Gebser, Torsten Grote, Roland Kaminski and Torsten Schaub: Reactive Answer Set Programming
* Kim Bauters, Steven Schockaert, Dirk Vermeir and Martine De Cock: Communicating ASP and the polynomial hierarchy
* Felicidad Aguado, Pedro Cabalar, Gilberto Pérez and Concepción Vidal: Loop Formulas for Splitable Temporal Logic Programs
* Thomas Eiter, Michael Fink, Giovambattista Ianni, Thomas Krennwallner and Peter Schüller: Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
* Thomas Eiter, Michael Fink and Peter Schüller: Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
* Onofrio Febbraro, Kristian Reale and Francesco Ricca: ASPIDE: Integrated Development Environment for Answer Set Programming
* Marcello Balduccini: Industrial-Size Scheduling with ASP+CP
* Enrico Pontelli, Ngoc-Hieu Nguyen, Tran Son and Chiaki Sakama: ASP-Prolog for Negotiation Among Dishonest Agents
* Michael Fink, Lucantonio Ghionna and Antonius Weinzierl: Relational Information Exchange and Aggregation in Multi-Context Systems
* Johannes Oetsch, Jörg Pührer and Hans Tompits: Stepping through an Answer-Set Program
* Mario Alviano, Gianluigi Greco and Nicola Leone: Dynamic Magic Sets for Programs with Monotone Recursive Aggregates
* Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemela and Jia-Huai You: Strong Equivalence of Logic Programs with Abstract Constraint Atoms
* Martin Slota and Joao Leite: Back and Forth Between Rules and SE-Models

Short papers:
* Ho-Pun Lam and Guido Governatori: What are the Necessity Rules in Defeasible Reasoning?
* Antonis Bikakis and Grigoris Antoniou: Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic
* Diego R. García, Sebastian Gottifredi, Patrick Krümpelmann, Matthias Thimm, Gabriele Kern-Isberner, Marcelo A. Falappa and Alejandro J. García: On Influence and Contractions in Defeasible Logic Programming
* Yuliya Lierler and Vladimir Lifschitz: Termination of grounding is not preserved by strongly equivalent transformations
* Emad Saad and Gerhard Brewka: Aggregates in Answer Set Optimization
* Martin Gebser, Roland Kaminski, Arne Koenig and Torsten Schaub: Advances in gringo series 3
* Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Thomas Schneider and Stefan Ziller: A Portfolio Solver for Answer Set Programming: Preliminary Report
* Martin Gebser, Roland Kaminski, Murat Knecht and Torsten Schaub: plasp: A Prototype for PDDL-Based Planning in ASP
* Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub and Bettina Schnor: Cluster-based ASP Solving with claspar
* Pedro Cabalar and Martín Diéguez: STeLP – a Tool for Temporal Answer Set Programming
* Neng-Fa Zhou, Yi-Dong Shen and Jia-Huai You: Compiling Answer Set Programs into Event-Driven Action Rules
* Steve Barker and Valerio Genovese: Secommunity: a Framework for Distributed Access Control
* Rosamaria Barilaro, Francesco Ricca and Giorgio Terracina: Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis
* Luis Fariñas del Cerro and Andreas Herzig: Contingency-based equilibrium logic
* Stefania Costantini and Andrea Formisano: Weight Constraints with Preferences in Answer Set Programming
* Ricardo Gonçalves and José Júlio Alferes: Parametrized equilibrium logic
* Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer and Hans Tompits: Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison
* Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits and Patrick Zwickl: VIDEAS: A Development Tool for Answer-Set Programs based on Model-Driven Engineering Technology
* Joohyung Lee and Ravi Palla: Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report)
* Johannes Oetsch and Hans Tompits: Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence
* Matti Järvisalo: Itemset Mining as a Challenge Application for Answer Set Enumeration
* Michael Gelfond: New Semantics for Epistemic Specifications
* Mikolas Janota and Joao Marques-Silva: Circumscription-Based MUS Membership Testing
* Ana Sofia Gomes and Jose Julio Alferes: Transaction Logic with External Actions
* Mauricio Osorio, José Luis Carballido and Claudia Zepeda: An application of clasp in the study of logics
* Erdi Aker, Ahmetcan Erdogan, Esra Erdem and Volkan Patoglu: Causal reasoning for planning and coordination of multiple housekeeping robots