11. LPNMR 2011:
Vancouver, Canada
James P. Delgrande, Wolfgang Faber (Eds.):
Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings.
Lecture Notes in Computer Science 6645 Springer 2011, ISBN 978-3-642-20894-2 
Invited Talks
- David Poole:
Logic, Probability and Computation: Foundations and Issues of Statistical Relational AI.
1-9
- David Pearce:
Foundations and Extensions of Answer Set Programming: The Logical Approach.
10-11
- Chitta Baral:
Lessons from Efforts to Automatically Translate English to Knowledge Representation Languages.
12
Technical Papers
Long Technical Papers
- Carlos Viegas Damásio, João Moura:
Modularity of P-Log Programs.
13-25
- Christian Drescher, Thomas Eiter, Michael Fink, Thomas Krennwallner, Toby Walsh:
Symmetry Breaking for Distributed Multi-Context Systems.
26-39
- Ringo Baumann:
Splitting an Argumentation Framework.
40-53
- Martin Gebser, Torsten Grote, Roland Kaminski, Torsten Schaub:
Reactive Answer Set Programming.
54-66
- Kim Bauters, Steven Schockaert, Dirk Vermeir, Martine De Cock:
Communicating ASP and the Polynomial Hierarchy.
67-79
- Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal:
Loop Formulas for Splitable Temporal Logic Programs.
80-92
- Thomas Eiter, Michael Fink, Giovambattista Ianni, Thomas Krennwallner, Peter Schüller:
Pushing Efficient Evaluation of HEX Programs by Modular Decomposition.
93-106
- Thomas Eiter, Michael Fink, Peter Schüller:
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems.
107-119
- Michael Fink, Lucantonio Ghionna, Antonius Weinzierl:
Relational Information Exchange and Aggregation in Multi-Context Systems.
120-133
- Johannes Oetsch, Jörg Pührer, Hans Tompits:
Stepping through an Answer-Set Program.
134-147
- Mario Alviano, Gianluigi Greco, Nicola Leone:
Dynamic Magic Sets for Programs with Monotone Recursive Aggregates.
148-160
- Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You:
Strong Equivalence of Logic Programs with Abstract Constraint Atoms.
161-173
- Martin Slota, João Leite:
Back and Forth between Rules and SE-Models.
174-186
Short Technical Papers
- Ho-Pun Lam, Guido Governatori:
What Are the Necessity Rules in Defeasible Reasoning?
187-192
- Antonis Bikakis, Grigoris Antoniou:
Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic.
193-198
- Diego R. García, Sebastian Gottifredi, Patrick Krümpelmann, Matthias Thimm, Gabriele Kern-Isberner, Marcelo A. Falappa, Alejandro Javier García:
On Influence and Contractions in Defeasible Logic Programming.
199-204
- Yuliya Lierler, Vladimir Lifschitz:
Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations.
205-210
- Emad Saad, Gerhard Brewka:
Aggregates in Answer Set Optimization.
211-216
- Rosamaria Barilaro, Francesco Ricca, Giorgio Terracina:
Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis.
217-222
- Luis Fariñas del Cerro, Andreas Herzig:
Contingency-Based Equilibrium Logic.
223-228
- Stefania Costantini, Andrea Formisano:
Weight Constraints with Preferences in ASP.
229-235
- Ricardo Gonçalves, José Júlio Alferes:
Parametrized Equilibrium Logic.
236-241
- Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison.
242-247
- Joohyung Lee, Ravi Palla:
Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report).
248-253
- Johannes Oetsch, Hans Tompits:
Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence.
254-259
- Michael Gelfond:
New Semantics for Epistemic Specifications.
260-265
- Mikolás Janota, João Marques-Silva:
cmMUS: A Tool for Circumscription-Based MUS Membership Testing.
266-271
- Ana Sofia Gomes, José Júlio Alferes:
Transaction Logic with External Actions.
272-277
- Mauricio Osorio, José Luis Carballido, Claudia Zepeda:
An Application of Clasp in the Study of Logics.
278-283
Application Descriptions
Long Application Description
Short Application Descriptions
System Descriptions
Long System Descriptions
Short System Descriptions
- Martin Gebser, Roland Kaminski, Arne König, Torsten Schaub:
Advances in gringo Series 3.
345-351
- Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Thomas Schneider, Stefan Ziller:
A Portfolio Solver for Answer Set Programming: Preliminary Report.
352-357
- Martin Gebser, Roland Kaminski, Murat Knecht, Torsten Schaub:
plasp: A Prototype for PDDL-Based Planning in ASP.
358-363
- Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Bettina Schnor:
Cluster-Based ASP Solving with claspar.
364-369
- Pedro Cabalar, Martín Diéguez:
STeLP - A Tool for Temporal Answer Set Programming.
370-375
- Neng-Fa Zhou, Yi-Dong Shen, Jia-Huai You:
Compiling Answer Set Programs into Event-Driven Action Rules.
376-381
- Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits, Patrick Zwickl:
VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology.
382-387
ASP Competition
- Francesco Calimeri, Giovambattista Ianni, Francesco Ricca, Mario Alviano, Annamaria Bria, Gelsomina Catalano, Susanna Cozza, Wolfgang Faber, Onofrio Febbraro, Nicola Leone, Marco Manna, Alessandra Martello, Claudio Panetta, Simona Perri, Kristian Reale, Maria Carmela Santoro, Marco Sirianni, Giorgio Terracina, Pierfrancesco Veltri:
The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track.
388-403
Last update Tue May 21 17:41:40 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
