LEADER 07446nam 22006735 450 001 996466163003316 005 20200705000041.0 010 $a3-540-37188-5 024 7 $a10.1007/11814771 035 $a(CKB)1000000000283745 035 $a(SSID)ssj0000316399 035 $a(PQKBManifestationID)11246743 035 $a(PQKBTitleCode)TC0000316399 035 $a(PQKBWorkID)10275109 035 $a(PQKB)10184378 035 $a(DE-He213)978-3-540-37188-5 035 $a(MiAaPQ)EBC3068093 035 $a(PPN)123137187 035 $a(EXLCZ)991000000000283745 100 $a20101221d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomated Reasoning$b[electronic resource] $eThird International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings /$fedited by Ulrich Furbach, Natarajan Shankar 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XVI, 688 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v4130 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-37187-7 320 $aIncludes bibliographical references and index. 327 $aInvited 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 -- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers -- Dynamic Logic with Non-rigid Functions -- Session 6. System Description 2 -- AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework -- CEL ? A Polynomial-Time Reasoner for Life Science Ontologies -- FaCT++ Description Logic Reasoner: System Description -- Importing HOL into Isabelle/HOL -- Session 7. Search -- Geometric Resolution: A Proof Procedure Based on Finite Model Search -- A Powerful Technique to Eliminate Isomorphism in Finite Model Search -- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems -- Session 8. Proof Theory -- Strong Cut-Elimination Systems for Hudelmaier?s Depth-Bounded Sequent Calculus for Implicational Logic -- Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach -- First-Order Logic with Dependent Types -- Session 9. Proof Checking -- Automating Proofs in Category Theory -- Formal Global Optimisation with Taylor Models -- A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers -- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials -- Session 10. Combination -- A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) -- Solving Sparse Linear Constraints -- Inferring Network Invariants Automatically -- A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL -- Session 11. Decision Procedures -- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures -- Verifying Mixed Real-Integer Quantifier Elimination -- Presburger Modal Logic Is PSPACE-Complete -- Tree Automata with Equality Constraints Modulo Equational Theories -- Session 12. CASC-J3 -- CASC-J3 The 3rd IJCAR ATP System Competition -- Session 13. Rewriting -- Matrix Interpretations for Proving Termination of Term Rewriting -- Partial Recursive Functions in Higher-Order Logic -- On the Strength of Proof-Irrelevant Type Theories -- Consistency and Completeness of Rewriting in the Calculus of Constructions -- Session 14. Description Logic -- Specifying and Reasoning About Dynamic Access-Control Policies -- On Keys and Functional Dependencies as First-Class Citizens in Description Logics -- A Resolution-Based Decision Procedure for . 330 $aThis 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. 410 0$aLecture Notes in Artificial Intelligence ;$v4130 606 $aArtificial intelligence 606 $aMathematical logic 606 $aComputer logic 606 $aSoftware engineering 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aSoftware engineering. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 676 $a006.3 702 $aFurbach$b Ulrich$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShankar$b Natarajan$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466163003316 996 $aAutomated Reasoning$9771895 997 $aUNISA