8. LPNMR 2005: Diamante, Italy

Invited Papers

• Michael Kifer:
  Nonmonotonic Reasoning in FLORA-2. 1-12
  
• Thomas Eiter:
  Data Integration and Answer Set Programming. 13-25
  
• Jürgen Angele, Eddie Mönch, Henrik Oppermann, Dirk Wenke:
  Halo I: A Controlled Experiment for Large Scale Knowledge Base Development. 26-39
  

ASP Foundations

• Wolfgang Faber:
  Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates. 40-52
  
• Martin Gebser, Torsten Schaub:
  Loops: Relevant or Redundant? 53-65
  
• Victor W. Marek, Inna Pivkina, Miroslaw Truszczynski:
  Approximating Answer Sets of Unitary Lifschitz-Woo Programs. 66-78
  
• Paolo Ferraris:
  On Modular Translations and Strong Equivalence. 79-91
  

ASP Extensions

• Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir:
  Guarded Open Answer Set Programming. 92-104
  
• Francesco Calimeri, Giovambattista Ianni:
  External Sources of Computation for Answer Set Solvers. 105-118
  
• Paolo Ferraris:
  Answer Sets for Propositional Theories. 119-131
  

Applications

• Bert Van Nuffelen, Ofer Arieli, Alvaro Cortés-Calabuig, Maurice Bruynooghe:
  An ID-Logic Formalization of the Composition of Autonomous Databases. 132-144
  
• Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe:
  On the Local Closed-World Assumption of Data-Sources. 145-157
  
• Carlos Iván Chesñevar, Guillermo Ricardo Simari, Lluis Godo:
  Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming. 158-171
  

Actions and Causations

• Tran Cao Son, Phan Huy Tu, Michael Gelfond, A. Ricardo Morales:
  An Approximation of Action Theories of and Its Application to Conformant Planning. 172-184
  
• Alberto Finzi, Thomas Lukasiewicz:
  Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories. 185-197
  
• Marek J. Sergot, Robert Craven:
  Some Logical Properties of Nonmonotonic Causal Theories. 198-210
  
• Antonis C. Kakas, Loizos Michael, Rob Miller:
  Modular-epsilon: An Elaboration Tolerant Approach to the Ramification and Qualification Problems. 211-226
  

Algorithms and Computation

• Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy:
  Platypus: A Platform for Distributed Answer Set Solving. 227-239
  
• Wolfgang Faber, Francesco Ricca:
  Solving Hard ASP Programs Efficiently. 240-252
  
• Hai-Feng Guo:
  Mode-Directed Fixed Point Computation. 253-265
  
• Jia-Huai You, Guohua Liu, Li-Yan Yuan, Curtis Onuczko:
  Lookahead in Smodels Compared to Local Consistencies in CSP. 266-278
  

Foundations

• Kewen Wang, Yan Zhang:
  Nested Epistemic Logic Programs. 279-290
  
• Joost Vennekens, Marc Denecker:
  An Algebraic Account of Modularity in ID-Logic. 291-303
  
• Iselin Engan, Tore Langholm, Espen H. Lian, Arild Waaler:
  Default Reasoning with Preference Within Only Knowing Logic. 304-316
  

Semantics

• Francesco Buccafurri, Gianluca Caminiti:
  A Social Semantics for Multi-agent Systems. 317-329
  
• Alex Dekhtyar, Michael I. Dekhtyar:
  Revisiting the Semantics of Interval Probabilistic Logic Programs. 330-342
  
• Sergei P. Odintsov, David Pearce:
  Routley Semantics for Answer Sets. 343-355
  
• Federico Banti, José Júlio Alferes, Antonio Brogi, Pascal Hitzler:
  The Well Supported Semantics for Multidimensional Dynamic Logic Programs. 356-368
  

Application Track

• Gang Wu, Jia-Huai You, Guohui Lin:
  Application of Smodels in Quartet Based Phylogeny Construction. 369-373
  
• Christoph Beierle, Oliver Dusso, Gabriele Kern-Isberner:
  Using Answer Set Programming for a Decision Support System. 374-378
  
• Nicola Leone, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Luigi Granata, Gianluigi Greco, Edyta Kalka, Giovambattista Ianni, Domenico Lembo, Maurizio Lenzerini, Vincenzino Lio, Bartosz Nowicki, Riccardo Rosati, Marco Ruzzi, Witold Staniszkis, Giorgio Terracina:
  Data Integration: a Challenging ASP Application. 379-383
  
• Kathrin Konczak, Ralf Vogel:
  Abduction and Preferences in Linguistics. 384-388
  
• Irene Papatheodorou, Antonis C. Kakas, Marek J. Sergot:
  Inference of Gene Relations from Microarray Data by Abduction. 389-393
  

System Track

• Susanne Grell, Kathrin Konczak, Torsten Schaub:
  nomore^<: A System for Computing Preferred Answer Sets. 394-398
  
• Omar El-Khatib, Enrico Pontelli, Tran Cao Son:
  Integrating an Answer Set Solver into Prolog: ASP-PROLOG. 399-404
  
• Emilia Oikarinen, Tomi Janhunen:
  circ2dlp - Translating Circumscription into Disjunctive Logic Programming. 405-409
  
• Lengning Liu, Miroslaw Truszczynski:
  Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers. 410-415
  
• Thomas Eiter, Michael Fink, Ján Senko:
  KMonitor - A Tool for Monitoring Plan Execution in Action Theories. 416-421
  
• Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub:
  The nomore++ System. 422-426
  
• Islam Elkabani, Enrico Pontelli, Tran Cao Son:
  Smodels^A - A System for Computing Answer Sets of Logic Programs with Aggregates. 427-431
  
• Francesco Ricca, Nicola Leone, Valerio De Bonis, Tina Dell'Armi, Stefania Galizia, Giovanni Grasso:
  A DLP System with Object-Oriented Features. 432-436
  
• Thomas Eiter, Wolfgang Faber, Patrick Traxler:
  Testing Strong Equivalence of Datalog Programs - Implementation and Examples. 437-441
  
• Yin Chen, Fangzhen Lin, Lei Li:
  SELP - A System for Studying Strong Equivalence Between Logic Programs. 442-446
  
• Yuliya Lierler:
  cmodels - SAT-Based Disjunctive Answer Set Solver. 447-451