10. LPNMR 2009:
Potsdam, Germany
Esra Erdem, Fangzhen Lin, Torsten Schaub (Eds.):
Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings.
Lecture Notes in Computer Science 5753 Springer 2009, ISBN 978-3-642-04237-9 
Invited Talks
Technical Papers
- Marcello Balduccini:
How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP.
4-16
- Marcello Balduccini:
Splitting a CR-Prolog Program.
17-29
- Antonis Bikakis, Grigoris Antoniou:
Contextual Argumentation in Ambient Intelligence.
30-43
- Gerhard Brewka, Thomas Eiter:
Argumentation Context Systems: A Framework for Abstract Group Argumentation.
44-57
- Pedro Cabalar, David Pearce, Agustín Valverde:
A Revised Concept of Safety for General Answer Set Programs.
58-70
- Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone:
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs.
71-86
- Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner:
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs.
87-100
- Jos de Bruijn, Stijn Heymans:
Complexity of the Stable Model Semantics for Queries on Incomplete Databases.
101-114
- Wolfgang Faber, Stefan Woltran:
Manifold Answer-Set Programs for Meta-reasoning.
115-128
- Ping Hou, Marc Denecker:
A Deductive System for FO(ID) Based on Least Fixpoint Logic.
129-141
- Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev:
Computing Stable Models via Reductions to Difference Logic.
142-154
- Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä:
A Module-Based Framework for Multi-language Constraint Modeling.
155-168
- Tim Kimber, Krysia Broda, Alessandra Russo:
Induction on Failure: Learning Connected Horn Theories.
169-181
- Joohyung Lee, Yunsong Meng:
On Reductive Semantics of Aggregates in Answer Set Programming.
182-195
- Claire Lefèvre, Pascal Nicolas:
A First Order Forward Chaining Approach for Answer Set Computing.
196-208
- Loizos Michael, Antonis C. Kakas:
Knowledge Qualification through Argumentation.
209-222
- Gayathri Namasivayam, Miroslaw Truszczynski:
Simple Random Logic Programs.
223-235
- Emilia Oikarinen, Matti Järvisalo:
Max-ASP: Maximum Satisfiability of Answer Set Programs.
236-249
- Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Belief Revision with Bounded Treewidth.
250-263
- Jörg Pührer, Hans Tompits:
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection.
264-276
- Yi-Dong Shen, Jia-Huai You:
A Default Approach to Semantics of Logic Programs with Constraint Atoms.
277-289
- Michael Thomas:
The Complexity of Circumscriptive Inference in Post's Lattice.
290-302
- Miroslaw Truszczynski:
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs.
303-315
- Hui Wan, Michael Kifer:
Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence.
316-328
- Yisong Wang, Jia-Huai You, Li-Yan Yuan, Mingyi Zhang:
Weight Constraint Programs with Functions.
329-341
Original Application Papers
- Ozan Caldiran, Kadir Haspalamutgil, Abdullah Ok, Can Palaz, Esra Erdem, Volkan Patoglu:
Bridging the Gap between High-Level Reasoning and Low-Level Control.
342-354
- James P. Delgrande, Torsten Grote, Aaron Hunter:
A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming.
355-367
- Salvatore Maria Ielpa, Salvatore Iiritano, Nicola Leone, Francesco Ricca:
An ASP-Based System for e-Tourism.
368-381
- Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions.
382-395
Short Papers
- Vernon Asuncion, Yan Zhang:
Translating Preferred Answer Set Programs to Propositional Logic.
396-401
- Marcello Balduccini:
CR-Prolog as a Specification Language for Constraint Satisfaction Problems.
402-408
- Chitta Baral, Tran Cao Son, Enrico Pontelli:
Modeling Multi-agent Domains in an Action Languages: An Empirical Study Using .
409-415
- Duygu Çakmak, Esra Erdem, Halit Erdogan:
Computing Weighted Solutions in Answer Set Programming.
416-422
- Agostino Dovier, Andrea Formisano, Enrico Pontelli:
Representing Multi-agent Planning in CLP.
423-429
- Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results.
430-436
- Luke Hopton, Owen Cliffe, Marina De Vos, Julian A. Padget:
AQL: A Query Language for Action Domains Modelled Using Answer Set Programming.
437-443
- Guohua Liu:
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs.
444-449
- Luís Moniz Pereira, Alexandre Miguel Pinto:
Layer Supported Models of Logic Programs.
450-456
- Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, Francesco Pagano:
Applying ASP to UML Model Validation.
457-463
- Mauricio Osorio, Simone Pascucci:
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach.
464-469
- Chiaki Sakama:
Social Default Theories.
470-476
System Descriptions
- Annamaria Bria, Wolfgang Faber, Nicola Leone:
nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver.
477-482
- Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone:
An ASP System with Functions, Lists, and Sets.
483-489
- Enrico Ellguth, Martin Gebser, Markus Gusowski, Benjamin Kaufmann, Roland Kaminski, Stefan Liske, Torsten Schaub, Lars Schneidenbach, Bettina Schnor:
A Simple Distributed Conflict-Driven Answer Set Solver.
490-495
- Marc Finthammer, Christoph Beierle, Benjamin Berger, Gabriele Kern-Isberner:
An Implementation of Belief Change Operations Based on Probabilistic Conditional Logic.
496-501
- Martin Gebser, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sven Thiele:
On the Input Language of ASP Grounder Gringo.
502-508
- Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
The Conflict-Driven Answer Set Solver clasp: Progress Report.
509-514
- Joohyung Lee, Ravi Palla:
System f2lp - Computing Answer Sets of First-Order Formulas.
515-521
- Claire Lefèvre, Pascal Nicolas:
The First Version of a New ASP Solver : ASPeRiX.
522-527
- Nicola Leone, Francesco Ricca, Giorgio Terracina:
An ASP-Based Data Integration System.
528-534
- Victor Noël, Antonis C. Kakas:
Gorgias-C: Extending Argumentation with Constraint Solving.
535-541
Summaries of Existing Successful Applications Papers
- Georg Boenn, Martin Brain, Marina De Vos, John Fitch:
ANTON: Composing Logic and Logic Composing.
542-547
- Owen Cliffe, Marina De Vos, Julian A. Padget:
Modelling Normative Frameworks Using Answer Set Programing.
548-553
- Tom Crick, Martin Brain, Marina De Vos, John Fitch:
Generating Optimal Code Using Answer Set Programming.
554-559
- Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli:
Logic Programming Techniques in Protein Structure Determination: Methodologies and Results.
560-566
- Esra Erdem:
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming.
567-572
- Esra Erdem, Ozan Erdem, Ferhan Türe:
HAPLO-ASP: Haplotype Inference Using Answer Set Programming.
573-578
- François Gagnon, Babak Esfandiari:
Using Answer Set Programming to Enhance Operating System Discovery.
579-584
- Alessandra Mileo, Davide Merico, Roberto Bisiani:
Non-monotonic Reasoning Supporting Wireless Sensor Networks for Intelligent Monitoring: The SINDI System.
585-590
Short Application Papers
Panel on Future Applications
System Competition
Last update Fri May 24 12:54:13 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
