Skip to main content
  • Conference proceedings
  • © 2010

Logic for Programming, Artificial Intelligence, and Reasoning

17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): LPAR: Logic for Programming, Artificial Intelligence, and Reasoning

Conference proceedings info: LPAR 2010.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

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

Table of contents (45 papers)

  1. Front Matter

  2. The Complexity of Partial-Observation Parity Games

    • Krishnendu Chatterjee, Laurent Doyen
    Pages 1-14
  3. Awareness in Games, Awareness in Logic

    • Joseph Y. Halpern
    Pages 15-15
  4. Human and Unhuman Commonsense Reasoning

    • Michael J. Maher
    Pages 16-29
  5. Gödel Logics – A Survey

    • Norbert Preining
    Pages 30-51
  6. Extended Computation Tree Logic

    • Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
    Pages 67-81
  7. SAT Encoding of Unification in \(\mathcal{EL}\)

    • Franz Baader, Barbara Morawska
    Pages 97-111
  8. Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers

    • Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue
    Pages 112-126
  9. Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models

    • Jasmin Christian Blanchette, Koen Claessen
    Pages 127-141
  10. Characterising Space Complexity Classes via Knuth-Bendix Orders

    • Guillaume Bonfante, Georg Moser
    Pages 142-156
  11. Focused Natural Deduction

    • Taus Brock-Nannestad, Carsten Schürmann
    Pages 157-171
  12. How to Universally Close the Existential Rule

    • Kai Brünnler
    Pages 172-186
  13. On the Complexity of the Bernays-Schönfinkel Class with Datalog

    • Witold Charatonik, Piotr Witkowski
    Pages 187-201
  14. Lazy Abstraction for Size-Change Termination

    • Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
    Pages 217-232
  15. A Syntactical Approach to Qualitative Constraint Networks Merging

    • Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind
    Pages 233-247
  16. On the Satisfiability of Two-Variable Logic over Data Words

    • Claire David, Leonid Libkin, Tony Tan
    Pages 248-262

Other Volumes

  1. Logic for Programming, Artificial Intelligence, and Reasoning

Editors and Affiliations

  • Institut für Computersprachen 185.2, Theory and Logic Group, TU Wien, Vienna, Austria

    Christian G. Fermüller

  • School of Computer Science, University of Manchester, Manchester, United Kingdom

    Andrei Voronkov

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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