Logic for Programming, Artificial Intelligence, and Reasoning 编程、人工智能与推理用逻辑学

Session 1 Invited Talk
Monodic Fragments of First-Order Temporal Logics：2000-2002A.D
Session 2 Verification
On Bounded Specifications
Improving Automata Generation for Linear Temporal Logic
Local Temporal Logic Is Expressively Complete
Session 3 Guarded Logics
Games and Model Checking for Guarded Logics
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
Session 4 Agents
Logical Omniscience and the Cost of Deliberation
Local Conditional High-Level Robot Programs
A Refinement Theory That Supports Reasoning about Knowledge and Time for Synchronous Agents
Session 5 Automated Theorem Proving
Proof and Model Generation with Disconnection Tableaux
Counting the Number of Equivalent Binary Resolution Proofs
Session 6 Automated Theorem Proving
Splitting through New Proposition Symbols
Complexity of Linear Standard Theories
Herbrand's Theorem for Prenex Godel Logic and Its Consequences for Theorem Proving
Session 7 Non-classical Logics
Unification in a Description Logic with Transitive Closure of Roles
Intuitionisted Acyclic Graph Descriptions
Session 8 Types
Coherence and Transitivity in Coercive Subtyping
A Type-Theoretic Approach to Induction with
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
Session 9 Experimental Papers
Model Generation with Boolean Constraints
First-Order Atom Definitions Extended
Automated Proof Support for Interval Logics
Session 10 Foundations of Logic
Session 11 CSP and SAT
Session 12 Non-monotonic Reasoning
Session 13 Semantics