Logic Programming and Nonmonotonic Reasoning

8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005. Proceedings

  • Chitta Baral
  • Gianluigi Greco
  • Nicola Leone
  • Giorgio Terracina
Conference proceedings LPNMR 2005

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3662)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 3662)

Table of contents

  1. Front Matter
    PDF

  2. Invited Papers

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

  3. ASP Foundations

    1. Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates
      Wolfgang Faber
      Pages 40-52
    2. Loops: Relevant or Redundant?
      Martin Gebser, Torsten Schaub
      Pages 53-65
    3. Approximating Answer Sets of Unitary Lifschitz-Woo Programs
      Victor W. Marek, Inna Pivkina, Mirosław Truszczyński
      Pages 66-78
    4. On Modular Translations and Strong Equivalence
      Paolo Ferraris
      Pages 79-91

  4. ASP Extensions

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

  5. Applications

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

  6. Actions and Causations

    1. An Approximation of Action Theories of \(\mathcal{AL}\) and Its Application to Conformant Planning
      Tran Cao Son, Phan Huy Tu, Michael Gelfond, A. Ricardo Morales
      Pages 172-184
    2. Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories
      Alberto Finzi, Thomas Lukasiewicz
      Pages 185-197
    3. Some Logical Properties of Nonmonotonic Causal Theories
      Marek Sergot, Robert Craven
      Pages 198-210
    4. \(\mathcal{M}\)odular-ε: An Elaboration Tolerant Approach to the Ramification and Qualification Problems
      Antonis Kakas, Loizos Michael, Rob Miller
      Pages 211-226

  7. Algorithms and Computation

    1. Platypus: A Platform for Distributed Answer Set Solving
      Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy
      Pages 227-239
    2. Solving Hard ASP Programs Efficiently
      Wolfgang Faber, Francesco Ricca
      Pages 240-252

About these proceedings

Keywords

Extension algorithms complexity heuristics knowledge logic nonmonotonic reasoning programming software engineering

Editors and affiliations

  • Chitta Baral
    • 1
  • Gianluigi Greco
    • 2
  • Nicola Leone
    • 3
  • Giorgio Terracina
    • 2
  1. 1.School of Computing and InformaticsArizona State UniversityTempe
  2. 2.Dipartimento di MatematicaUniversità della CalabriaRendeItaly
  3. 3.Department of MathematicsUniversity of CalabriaRendeItaly

Bibliographic information

  • DOI https://doi.org/10.1007/11546207
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-28538-0
  • Online ISBN 978-3-540-31827-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book