Advertisement

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
    3. Mode-Directed Fixed Point Computation
      Hai-Feng Guo
      Pages 253-265
    4. Lookahead in Smodels Compared to Local Consistencies in CSP
      Jia-Huai You, Guohua Liu, Li Yan Yuan, Curtis Onuczko
      Pages 266-278

  8. Foundations

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

  9. Semantics

    1. A Social Semantics for Multi-agent Systems
      Francesco Buccafurri, Gianluca Caminiti
      Pages 317-329
    2. Revisiting the Semantics of Interval Probabilistic Logic Programs
      Alex Dekhtyar, Michael I. Dekhtyar
      Pages 330-342
    3. Routley Semantics for Answer Sets
      Sergei Odintsov, David Pearce
      Pages 343-355
    4. The Well Supported Semantics for Multidimensional Dynamic Logic Programs
      F. Banti, J. J. Alferes, A. Brogi, P. Hitzler
      Pages 356-368

  10. Application Track

    1. Application of Smodels in Quartet Based Phylogeny Construction
      Gang Wu, Jia-Huai You, Guohui Lin
      Pages 369-373
    2. Using Answer Set Programming for a Decision Support System
      Christoph Beierle, Oliver Dusso, Gabriele Kern-Isberner
      Pages 374-378
    3. Data Integration: a Challenging ASP Application
      Nicola Leone, Thomas Eiter, Wolfgang Faber, Michael Fink, Georg Gottlob, Luigi Granata et al.
      Pages 379-383
    4. Abduction and Preferences in Linguistics
      Kathrin Konczak, Ralf Vogel
      Pages 384-388
    5. Inference of Gene Relations from Microarray Data by Abduction
      Irene Papatheodorou, Antonis Kakas, Marek Sergot
      Pages 389-393

  11. System Track

    1. nomore<: A System for Computing Preferred Answer Sets
      Susanne Grell, Kathrin Konczak, Torsten Schaub
      Pages 394-398
    2. Integrating an Answer Set Solver into Prolog: \(\mathbb{ASP}\) - \(\mathbb{PROLOG}\)
      Omar Elkhatib, Enrico Pontelli, Tran Cao Son
      Pages 399-404
    3. circ2dlp — Translating Circumscription into Disjunctive Logic Programming
      Emilia Oikarinen, Tomi Janhunen
      Pages 405-409
    4. Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers
      Lengning Liu, Mirosław Truszczyński
      Pages 410-415
    5. KMonitor– A Tool for Monitoring Plan Execution in Action Theories
      Thomas Eiter, Michael Fink, Ján Senko
      Pages 416-421
    6. The nomore++ System
      Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub
      Pages 422-426
    7. SmodelsA — A System for Computing Answer Sets of Logic Programs with Aggregates
      Islam Elkabani, Enrico Pontelli, Tran Cao Son
      Pages 427-431
    8. A DLP System with Object-Oriented Features
      Francesco Ricca, Nicola Leone, Valerio De Bonis, Tina Dell’Armi, Stefania Galizia, Giovanni Grasso
      Pages 432-436
    9. Testing Strong Equivalence of Datalog Programs – Implementation and Examples
      Thomas Eiter, Wolfgang Faber, Patrick Traxler
      Pages 437-441
    10. SELP – A System for Studying Strong Equivalence Between Logic Programs
      Yin Chen, Fangzhen Lin, Lei Li
      Pages 442-446
    11. cmodels – SAT-Based Disjunctive Answer Set Solver
      Yuliya Lierler
      Pages 447-451
  12. Back Matter
    PDF

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
  • Buy this book on publisher's site