000 07041nam a22005895i 4500
001 978-3-540-37188-5
003 DE-He213
005 20240730194846.0
007 cr nn 008mamaa
008 101221s2006 gw | s |||| 0|eng d
020 _a9783540371885
_9978-3-540-37188-5
024 7 _a10.1007/11814771
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aAutomated Reasoning
_h[electronic resource] :
_bThird International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings /
_cedited by Ulrich Furbach, Natarajan Shankar.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXVI, 688 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4130
505 0 _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 intoIsabelle/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 DynamicAccess-Control Policies -- On Keys and Functional Dependencies as First-Class Citizens in Description Logics -- A Resolution-Based Decision Procedure for .
520 _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.
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9158253
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9158254
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
700 1 _aFurbach, Ulrich.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9158255
700 1 _aShankar, Natarajan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9158256
710 2 _aSpringerLink (Online service)
_9158257
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540371878
776 0 8 _iPrinted edition:
_z9783540827511
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4130
_9158258
856 4 0 _uhttps://doi.org/10.1007/11814771
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95358
_d95358