自动推理Automated reasoning

This book constitutes the refereed proceedings of the Third International Joint Conference on Automated Reasoning, IJCAR 2006, held in Seattle, WA, USA in August 2006 as part of the 4th Federated Logic Conference, FLoC 2006. IJCAR 2006 is a merger of CADE, FroCoS, FTP, TABLEAUX, and TPHOLs.
The 41 revised full research papers and 8 revised system descriptions presented together with 3 invited papers and a summary of a systems competition were carefully reviewed and selected from a total of 152 submissions. The papers address the entire spectrum of research in automated reasoning including formalization of mathematics, proof theory, proof search, description logics, interactive proof checking, higher-order logic, combination methods, satisfiability procedures, and rewriting. The papers are organized in topical sections on proofs, search, higher-order logic, proof theory, search, proof checking, combination, decision procedures, CASC-J3, rewriting, and description logic.

The LNAI series reports state-of-the-art results in artificial intelligence re-search, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNAI has grown into the most comprehensive artificial intelligence research forum available.
The scope of LNAI spans the whole range of artificial intelligence and intelli- gent information processing including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
proceedings (published in time for the respective conference)；
post-proceedings (consisting of thoroughly revised final full papers)；
research monographs (which may be based on PhD work).

Invited Talks
　Mathematical Theory Exploration
　Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation
　Representing and Reasoning with Operational Semantics
Session 1. Proofs
　Flyspeck I: Tame Graphs
　Automatic Construction and Verification of Isotopy Invariants
　Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms
　Using the TPTP Language for Writing Derivations and Finite Interpretations
Session 2. Search
　Stratified Context Unification Is NP-Complete
　A Logical Characterization of Forward and Backward Chaining in the Inverse Method
　Connection Tableaux with Lazy Paramodulation
　Blocking and Other Enhancements for Bottom-Up Model Generation Methods
Session 3. System Description 1
　The MathServe System for Semantic Web Reasoning Services
　System Description: GCLCprover + GeoThms
　A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
　Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
Session 4. Higher-Order Logic
　Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
　Towards Self-verification of HOL Light
　An Interpretation of Isabelle/HOL in HOL Light
　Combining Type Theory and Untyped Set Theory
Session 5. Proof Theory
　Cut-Simulation in Impredicative Logics
　Interpolation in Local Theory Extensions
Session 6. System Description2
Session 7. Search
Session 8. Proof Theory
Session 9. Proof Checking
Session 10. Combinations
Session 11. Decision Procedures
Session 12. CASC-J3
Session 13. Rewriting
Session 14. Descrition Logic
Author Index