Logic for Programming, Artificial Intelligence, and Reasoning

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
3. Altmetric Badge
   Chapter 2 On Bounded Specifications
4. Altmetric Badge
   Chapter 3 Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
5. Altmetric Badge
   Chapter 4 Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
6. Altmetric Badge
   Chapter 5 Games and Model Checking for Guarded Logics
7. Altmetric Badge
   Chapter 6 Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
8. Altmetric Badge
   Chapter 7 Logical Omniscience and the Cost of Deliberation
9. Altmetric Badge
   Chapter 8 Local Conditional High-Level Robot Programs
10. Altmetric Badge
    Chapter 9 A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents
11. Altmetric Badge
    Chapter 10 Proof and Model Generation with Disconnection Tableaux
12. Altmetric Badge
    Chapter 11 Counting the Number of Equivalent Binary Resolution Proofs
13. Altmetric Badge
    Chapter 12 Splitting through New Proposition Symbols
14. Altmetric Badge
    Chapter 13 Complexity of Linear Standard Theories
15. Altmetric Badge
    Chapter 14 Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
16. Altmetric Badge
    Chapter 15 Unification in a Description Logic with Transitive Closure of Roles
17. Altmetric Badge
    Chapter 16 Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
18. Altmetric Badge
    Chapter 17 Coherence and Transitivity in Coercive Subtyping
19. Altmetric Badge
    Chapter 18 A Type-Theoretic Approach to Induction with Higher-Order Encodings
20. Altmetric Badge
    Chapter 19 Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
21. Altmetric Badge
    Chapter 20 Model Generation with Boolean Constraints
22. Altmetric Badge
    Chapter 21 First-Order Atom Definitions Extended
23. Altmetric Badge
    Chapter 22 Automated Proof Support for Interval Logics
24. Altmetric Badge
    Chapter 23 The Functions Provable by First Order Abstraction
25. Altmetric Badge
    Chapter 24 A Local System for Classical Logic
26. Altmetric Badge
    Chapter 25 Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
27. Altmetric Badge
    Chapter 26 Permutation Problems and Channelling Constraints
28. Altmetric Badge
    Chapter 27 Simplifying Binary Propositional Theories into Connected Components Twice as Fast
29. Altmetric Badge
    Chapter 28 Reasoning about Evolving Nonmonotonic Knowledge Bases
30. Altmetric Badge
    Chapter 29 Efficient Computation of the Well-Founded Model Using Update Propagation
31. Altmetric Badge
    Chapter 30 Indexed Categories and Bottom-Up Semantics of Logic Programs
32. Altmetric Badge
    Chapter 31 Functional Logic Programming with Failure: A Set-Oriented View
33. Altmetric Badge
    Chapter 32 Operational Semantics for Fixed-Point Logics on Constraint Databases
34. Altmetric Badge
    Chapter 33 Efficient Negation Using Abstract Interpretation
35. Altmetric Badge
    Chapter 34 Certifying Synchrony for Free
36. Altmetric Badge
    Chapter 35 A Computer Environment for Writing Ordinary Mathematical Proofs
37. Altmetric Badge
    Chapter 36 On Termination of Meta-programs
38. Altmetric Badge
    Chapter 37 A Monotonic Higher-Order Semantic Path Ordering
39. Altmetric Badge
    Chapter 38 The Elog Web Extraction Language
40. Altmetric Badge
    Chapter 39 Census Data Repair: A Challenging Application of Disjunctive Logic Programming
41. Altmetric Badge
    Chapter 40 Boolean Functions for Finite-Tree Dependencies
42. Altmetric Badge
    Chapter 41 How to Transform an Analyzer into a Verifier
43. Altmetric Badge
    Chapter 42 Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search
44. Altmetric Badge
    Chapter 43 Coherent Composition of Distributed Knowledge-Bases through Abduction
45. Altmetric Badge
    Chapter 44 Tableaux for Reasoning about Atomic Updates
46. Altmetric Badge
    Chapter 45 Inference of Termination Conditions for Numerical Loops in Prolog
47. Altmetric Badge
    Chapter 46 Termination of Rewriting with Strategy Annotations
48. Altmetric Badge
    Chapter 47 Inferring Termination Conditions for Logic Programs Using Backwards Analysis
49. Altmetric Badge
    Chapter 48 Reachability Analysis of Term Rewriting Systems with Timbuk
50. Altmetric Badge
    Chapter 49 Binding-Time Annotations without Binding-Time Analysis
51. Altmetric Badge
    Chapter 50 Concept Formation via Proof Planning Failure