Logic for Programming, Artificial Intelligence, and Reasoning

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

  • Christian G. Fermüller
  • Andrei Voronkov
Conference proceedings LPAR 2010

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

Table of contents

  1. Front Matter
    PDF
  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
    PDF
  4. Human and Unhuman Commonsense Reasoning
    Michael J. Maher
    Pages 16-29
  5. Gödel Logics – A Survey
    Norbert Preining
    Pages 30-51
  6. Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces
    Régis Alenda, Nicola Olivetti
    Pages 52-66
  7. Extended Computation Tree Logic
    Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte
    Pages 67-81
  8. Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics
    Franz Baader, Marcel Lippmann, Hongkai Liu
    Pages 82-96
  9. SAT Encoding of Unification in \(\mathcal{EL}\)
    Franz Baader, Barbara Morawska
    Pages 97-111
  10. Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers
    Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue
    Pages 112-126
  11. Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
    Jasmin Christian Blanchette, Koen Claessen
    Pages 127-141
  12. Characterising Space Complexity Classes via Knuth-Bendix Orders
    Guillaume Bonfante, Georg Moser
    Pages 142-156
  13. Focused Natural Deduction
    Taus Brock-Nannestad, Carsten Schürmann
    Pages 157-171
  14. How to Universally Close the Existential Rule
    Kai Brünnler
    Pages 172-186
  15. On the Complexity of the Bernays-Schönfinkel Class with Datalog
    Witold Charatonik, Piotr Witkowski
    Pages 187-201
  16. Magically Constraining the Inverse Method Using Dynamic Polarity Assignment
    Kaustuv Chaudhuri
    Pages 202-216
  17. Lazy Abstraction for Size-Change Termination
    Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
    Pages 217-232
  18. A Syntactical Approach to Qualitative Constraint Networks Merging
    Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind
    Pages 233-247
  19. On the Satisfiability of Two-Variable Logic over Data Words
    Claire David, Leonid Libkin, Tony Tan
    Pages 248-262
  20. Generic Methods for Formalising Sequent Calculi Applied to Provability Logic
    Jeremy E. Dawson, Rajeev Goré
    Pages 263-277

Other volumes

  1. Logic for Programming, Artificial Intelligence, and Reasoning
    16th International Conference, LPAR-16, Dakar, Senegal, April 25–May 1, 2010, Revised Selected Papers
  2. Logic for Programming, Artificial Intelligence, and Reasoning
    17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings

About these proceedings

Keywords

Extension artificial intelligence automated reasoning computational complexity concurrency constraint programming description logic description logics distributed systems knowledge knowledge base knowledge representation model checking modeling proving

Editors and affiliations

  • Christian G. Fermüller
    • 1
  • Andrei Voronkov
    • 2
  1. 1.Institut für Computersprachen 185.2, Theory and Logic GroupTU WienViennaAustria
  2. 2.School of Computer ScienceUniversity of ManchesterManchesterUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-16242-8
  • Copyright Information Springer Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-16241-1
  • Online ISBN 978-3-642-16242-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site