Skip to main content
Springer Nature Link
Account

Logic Programming and Nonmonotonic Reasoning

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

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Chitta Baral

    1. School of Computing and Informatics, Arizona State University, Tempe

  2. Gianluigi Greco

    1. Dipartimento di Matematica, Università della Calabria, Rende, Italy

  3. Nicola Leone

    1. Department of Mathematics, University of Calabria, Rende, Italy

  4. Giorgio Terracina

    1. Dipartimento di Matematica, Università della Calabria, Rende, Italy

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: LPNMR 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (44 papers)

  1. Front Matter

    Download chapter 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
Back to top

Other volumes

  1. Logic Programming and Nonmonotonic Reasoning

Editors and Affiliations

  • School of Computing and Informatics, Arizona State University, Tempe

    Chitta Baral

  • Dipartimento di Matematica, Università della Calabria, Rende, Italy

    Gianluigi Greco, Giorgio Terracina

  • Department of Mathematics, University of Calabria, Rende, Italy

    Nicola Leone

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top