Book Volume 2850 2003

Logic for Programming, Artificial Intelligence, and Reasoning

10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings


ISBN: 978-3-540-20101-4 (Print) 978-3-540-39813-4 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-32

    From Tableaux to Automata for Description Logics

  3. Chapter

    Pages 33-48

    Disproving False Conjectures

  4. Chapter

    Pages 49-58

    A Formal Proof of Dickson’s Lemma in ACL2

  5. Chapter

    Pages 59-77

    Imperative Object-Based Calculi in Co-inductive Type Theories

  6. Chapter

    Pages 78-90

    Congruence Closure with Integer Offsets

  7. Chapter

    Pages 91-106

    A Machine-Verified Code Generator

  8. Chapter

    Pages 107-121

    A Translation Characterizing the Constructive Content of Classical Theories

  9. Chapter

    Pages 122-136

    Extensions of Non-standard Inferences to Description Logics with Transitive Roles

  10. Chapter

    Pages 137-151

    Extended Canonicity of Certain Topological Properties of Set Spaces

  11. Chapter

    Pages 152-166

    Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics

  12. Chapter

    Pages 167-182

    Improving Dependency Pairs

  13. Chapter

    Pages 183-197

    On Closure under Complementation of Equational Tree Automata for Theories Extending AC

  14. Chapter

    Pages 198-212

    Completeness of E-Unification with Eager Variable Elimination

  15. Chapter

    Pages 213-213

    Computable Numberings

  16. Chapter

    Pages 214-228

    Handling Equality in Monodic Temporal Resolution

  17. Chapter

    Pages 229-243

    Once upon a Time in the West

  18. Chapter

    Pages 244-258

    Ordered Diagnosis

  19. Chapter

    Pages 259-273

    Computing Preferred Answer Sets in Answer Set Programming

  20. Chapter

    Pages 274-288

    A Syntax-Based Approach to Reasoning about Actions and Events

  21. Chapter

    Pages 289-289

    Minimizing Automata on Infinite Words

previous Page of 2