Skip to main content
Springer Nature Link
Account

Logic for Programming, Artificial Intelligence, and Reasoning

11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Franz Baader

    1. Theoretical Computer Science, TU Dresden, Germany

  2. Andrei Voronkov

    1. University of Manchester, UK

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

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

Included in the following conference series:

Conference proceedings info: LPAR 2004.

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 109.99
Price excludes VAT (Canada)
  • 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 (36 papers)

  1. Front Matter

    Download chapter PDF

  2. CERES in Many-Valued Logics

    • Matthias Baaz, Alexander Leitsch
    Pages 1-20

  3. A Decomposition Rule for Decision Procedures by Resolution-Based Calculi

    • Ullrich Hustadt, Boris Motik, Ulrike Sattler
    Pages 21-35

  4. Abstract DPLL and Abstract DPLL Modulo Theories

    • Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
    Pages 36-50

  5. Combining Lists with Non-stably Infinite Theories

    • Pascal Fontaine, Silvio Ranise, Calogero G. Zarba
    Pages 51-66

  6. Abstract Model Generation for Preprocessing Clause Sets

    • Miyuki Koshimura, Mayumi Umeda, Ryuzo Hasegawa
    Pages 67-78

  7. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying

    • Helmut Seidl, Kumar Neeraj Verma
    Pages 79-94

  8. Applications of General Exact Satisfiability in Propositional Logic Modelling

    • Vilhelm Dahllöf
    Pages 95-109

  9. BCiC: A System for Code Authentication and Verification

    • Nathan Whitehead, Martín Abadi
    Pages 110-124

  10. Ordered Resolution with Selection for \(\mathcal{H}(@)\)

    • Carlos Areces, Daniel Gorín
    Pages 125-141

  11. On a Semantic Subsumption Test

    • Jerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek
    Pages 142-153

  12. Suitable Graphs for Answer Set Programming

    • Thomas Linke, Vladimir Sarsakov
    Pages 154-168

  13. Weighted Answer Sets and Applications in Intelligence Analysis

    • Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
    Pages 169-183

  14. How to Fix It: Using Fixpoints in Different Contexts

    • Igor Walukiewicz
    Pages 184-193

  15. Reasoning About Systems with Transition Fairness

    • Benjamin Aminof, Thomas Ball, Orna Kupferman
    Pages 194-208

  16. Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games

    • Dietmar Berwanger, Erich Grädel
    Pages 209-223

  17. How the Location of * Influences Complexity in Kleene Algebra with Tests

    • Chris Hardin
    Pages 224-239

  18. The Equational Theory of 〈ℕ, 0, 1, + , ×, ↑〉 Is Decidable, but Not Finitely Axiomatisable

    • Roberto Di Cosmo, Thomas Dufour
    Pages 240-256

  19. A Trichotomy in the Complexity of Propositional Circumscription

    • Gustav Nordh
    Pages 257-269

  20. Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems

    • Lucas Bordeaux, Marco Cadoli, Toni Mancini
    Pages 270-284
Back to top

Other volumes

  1. Logic for Programming, Artificial Intelligence, and Reasoning

  2. Logic for Programming, Artificial Intelligence, and Reasoning

Editors and Affiliations

  • Theoretical Computer Science, TU Dresden, Germany

    Franz Baader

  • University of Manchester, UK

    Andrei Voronkov

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