Logic Programming and Nonmonotonic Reasoning: 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings

Description

This volume contains the refereed proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2011, held in May 2011 in Vancouver, Canada. The 16 revised full papers (13 technical papers, 1 application description, and 2 system descriptions) and 26 short papers (16 technical papers, 3 application description, and 7 system descriptions) which were carefully reviewed and selected from numerous submissions, are presented together with 3 invited talks. Being a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning, and knowledge representation, the conference aims to facilitate interactions between those researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those who work in the area of knowledge representation and nonmonotonic reasoning. Front Matter....Pages - Logic, Probability and Computation: Foundations and Issues of Statistical Relational AI....Pages 1-9 Foundations and Extensions of Answer Set Programming: The Logical Approach....Pages 10-11 Lessons from Efforts to Automatically Translate English to Knowledge Representation Languages....Pages 12-12 Modularity of P-Log Programs....Pages 13-25 Symmetry Breaking for Distributed Multi-Context Systems....Pages 26-39 Splitting an Argumentation Framework....Pages 40-53 Reactive Answer Set Programming....Pages 54-66 Communicating ASP and the Polynomial Hierarchy....Pages 67-79 Loop Formulas for Splitable Temporal Logic Programs....Pages 80-92 Pushing Efficient Evaluation of HEX Programs by Modular Decomposition....Pages 93-106 Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems....Pages 107-119 Relational Information Exchange and Aggregation in Multi-Context Systems....Pages 120-133 Stepping through an Answer-Set Program....Pages 134-147 Dynamic Magic Sets for Programs with Monotone Recursive Aggregates....Pages 148-160 Strong Equivalence of Logic Programs with Abstract Constraint Atoms....Pages 161-173 Back and Forth between Rules and SE -Models....Pages 174-186 What Are the Necessity Rules in Defeasible Reasoning?....Pages 187-192 Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic....Pages 193-198 On Influence and Contractions in Defeasible Logic Programming....Pages 199-204 Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations....Pages 205-210 Aggregates in Answer Set Optimization....Pages 211-216 Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis....Pages 217-222 Contingency-Based Equilibrium Logic....Pages 223-228 Weight Constraints with Preferences in ASP....Pages 229-235 Parametrized Equilibrium Logic....Pages 236-241 Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison....Pages 242-247 Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report)....Pages 248-253 Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence....Pages 254-259 New Semantics for Epistemic Specifications....Pages 260-265 cmMUS : A Tool for Circumscription-Based MUS Membership Testing....Pages 266-271 Transaction Logic with External Actions....Pages 272-277 An Application of Clasp in the Study of Logics....Pages 278-283 Industrial-Size Scheduling with ASP+CP....Pages 284-296 Secommunity: A Framework for Distributed Access Control....Pages 297-303 Itemset Mining as a Challenge Application for Answer Set Enumeration....Pages 304-310 Causal Reasoning for Planning and Coordination of Multiple Housekeeping Robots....Pages 311-316 ASPIDE: Integrated Development Environment for Answer Set Programming....Pages 317-330 ASP-Prolog for Negotiation among Dishonest Agents....Pages 331-344 Advances in gringo Series 3....Pages 345-351 A Portfolio Solver for Answer Set Programming: Preliminary Report....Pages 352-357 plasp: A Prototype for PDDL-Based Planning in ASP....Pages 358-363 Cluster-Based ASP Solving with claspar ....Pages 364-369 STeLP – A Tool for Temporal Answer Set Programming....Pages 370-375 Compiling Answer Set Programs into Event-Driven Action Rules....Pages 376-381 VIDEAS : A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology....Pages 382-387 The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track....Pages 388-403 Back Matter....Pages -