Automated Reasoning: Lecture Notes in Artificial Intelligence
Editat de Ulrich Furbach, Natarajan Shankaren Limba Engleză Paperback – 3 aug 2006
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.
Din seria Lecture Notes in Artificial Intelligence
- 20%
Preț: 317.85 lei - 20%
Preț: 327.36 lei - 20%
Preț: 638.44 lei - 20%
Preț: 331.30 lei - 20%
Preț: 641.62 lei - 20%
Preț: 324.19 lei - 20%
Preț: 314.67 lei - 20%
Preț: 330.54 lei - 20%
Preț: 678.21 lei - 20%
Preț: 636.86 lei - 20%
Preț: 428.17 lei - 20%
Preț: 324.19 lei - 20%
Preț: 298.88 lei - 20%
Preț: 316.28 lei - 20%
Preț: 639.07 lei - 20%
Preț: 321.81 lei - 20%
Preț: 315.48 lei - 20%
Preț: 620.33 lei - 20%
Preț: 338.47 lei - 20%
Preț: 635.26 lei - 20%
Preț: 635.26 lei -
Preț: 385.99 lei - 20%
Preț: 322.61 lei - 20%
Preț: 391.36 lei - 20%
Preț: 321.49 lei - 20%
Preț: 499.90 lei - 20%
Preț: 325.79 lei - 20%
Preț: 498.50 lei - 20%
Preț: 328.16 lei - 20%
Preț: 319.75 lei - 20%
Preț: 637.64 lei - 20%
Preț: 568.70 lei - 20%
Preț: 324.19 lei - 20%
Preț: 638.76 lei - 20%
Preț: 321.03 lei - 20%
Preț: 687.57 lei - 20%
Preț: 314.86 lei - 20%
Preț: 328.94 lei - 20%
Preț: 573.45 lei - 20%
Preț: 325.79 lei - 20%
Preț: 321.03 lei - 20%
Preț: 531.50 lei - 20%
Preț: 330.54 lei - 20%
Preț: 321.03 lei - 20%
Preț: 634.45 lei - 20%
Preț: 325.79 lei - 20%
Preț: 325.30 lei
Preț: 642.57 lei
Preț vechi: 803.21 lei
-20% Nou
Puncte Express: 964
Preț estimativ în valută:
113.72€ • 133.37$ • 99.71£
113.72€ • 133.37$ • 99.71£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540371878
ISBN-10: 3540371877
Pagini: 704
Ilustrații: XVI, 688 p.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.05 kg
Ediția:2006
Editura: Springer
Seria Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540371877
Pagini: 704
Ilustrații: XVI, 688 p.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.05 kg
Ediția:2006
Editura: Springer
Seria Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.- 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 .