Logic for Programming, Artificial Intelligence, and Reasoning

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

Editors:

ISBN: 978-3-642-16241-1 (Print) 978-3-642-16242-8 (Online)

Table of contents (45 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-14

    The Complexity of Partial-Observation Parity Games

  3. No Access

    Book Chapter

    Pages 15-15

    Awareness in Games, Awareness in Logic

  4. No Access

    Book Chapter

    Pages 16-29

    Human and Unhuman Commonsense Reasoning

  5. No Access

    Book Chapter

    Pages 30-51

    Gödel Logics – A Survey

  6. No Access

    Book Chapter

    Pages 52-66

    Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces

  7. No Access

    Book Chapter

    Pages 67-81

    Extended Computation Tree Logic

  8. No Access

    Book Chapter

    Pages 82-96

    Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics

  9. No Access

    Book Chapter

    Pages 97-111

    SAT Encoding of Unification in \(\mathcal{EL}\)

  10. No Access

    Book Chapter

    Pages 112-126

    Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers

  11. No Access

    Book Chapter

    Pages 127-141

    Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models

  12. No Access

    Book Chapter

    Pages 142-156

    Characterising Space Complexity Classes via Knuth-Bendix Orders

  13. No Access

    Book Chapter

    Pages 157-171

    Focused Natural Deduction

  14. No Access

    Book Chapter

    Pages 172-186

    How to Universally Close the Existential Rule

  15. No Access

    Book Chapter

    Pages 187-201

    On the Complexity of the Bernays-Schönfinkel Class with Datalog

  16. No Access

    Book Chapter

    Pages 202-216

    Magically Constraining the Inverse Method Using Dynamic Polarity Assignment

  17. No Access

    Book Chapter

    Pages 217-232

    Lazy Abstraction for Size-Change Termination

  18. No Access

    Book Chapter

    Pages 233-247

    A Syntactical Approach to Qualitative Constraint Networks Merging

  19. No Access

    Book Chapter

    Pages 248-262

    On the Satisfiability of Two-Variable Logic over Data Words

  20. No Access

    Book Chapter

    Pages 263-277

    Generic Methods for Formalising Sequent Calculi Applied to Provability Logic

  21. No Access

    Book Chapter

    Pages 278-293

    Characterising Probabilistic Processes Logically

previous Page of 3