Automated Reasoning: 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6173
Editat de Jürgen Giesl, Reiner Hähnleen Limba Engleză Paperback – 30 iun 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 556.96 lei - 20%
Preț: 400.77 lei - 15%
Preț: 558.12 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 620.33 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 984.64 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 793.92 lei - 20%
Preț: 324.19 lei - 20%
Preț: 733.68 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 634.45 lei
Preț vechi: 793.07 lei
-20%
Puncte Express: 952
Preț estimativ în valută:
112.20€ • 132.52$ • 96.67£
112.20€ • 132.52$ • 96.67£
Carte disponibilă
Livrare economică 27 februarie-13 martie
Specificații
ISBN-13: 9783642142024
ISBN-10: 3642142028
Pagini: 546
Ilustrații: XII, 536 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.82 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642142028
Pagini: 546
Ilustrații: XII, 536 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.82 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Logical Frameworks and Combination of Systems.- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus.- Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description).- MCMT: A Model Checker Modulo Theories.- On Hierarchical Reasoning in Combinations of Theories.- Description Logic I.- Global Caching for Coalgebraic Description Logics.- Tractable Extensions of the Description Logic with Numerical Datatypes.- Higher-Order Logic.- Analytic Tableaux for Higher-Order Logic with Choice.- Monotonicity Inference for Higher-Order Formulas.- Sledgehammer: Judgement Day.- Invited Talk.- Logic between Expressivity and Complexity.- Verification.- Multi-Prover Verification of Floating-Point Programs.- Verifying Safety Properties with the TLA?+? Proof System.- MUNCH - Automated Reasoner for Sets and Multisets.- A Slice-Based Decision Procedure for Type-Based Partial Orders.- Hierarchical Reasoning for the Verification of Parametric Systems.- First-Order Logic.- Interpolation and Symbol Elimination in Vampire.- iProver-Eq: An Instantiation-Based Theorem Prover with Equality.- Classical Logic with Partial Functions.- Non-Classical Logic.- Automated Reasoning for Relational Probabilistic Knowledge Representation.- Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse.- Terminating Tableaux for Hybrid Logic with Eventualities.- Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic.- Induction.- Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion.- Focused Inductive Theorem Proving.- Decision Procedures.- A Decidable Class of Nested Iterated Schemata.- RegSTAB: A SAT Solver for Propositional Schemata.- Linear Quantifier Elimination as an Abstract Decision Procedure.- ADecision Procedure for CTL* Based on Tableaux and Automata.- URBiVA: Uniform Reduction to Bit-Vector Arithmetic.- Keynote Talk.- Induction, Invariants, and Abstraction.- Arithmetic.- A Single-Significant-Digit Calculus for Semi-Automated Guesstimation.- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents.- An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.- Invited Talk.- Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development.- Applications.- Automating Security Analysis: Symbolic Equivalence of Constraint Systems.- System Description: The Proof Transformation System CERES.- Premise Selection in the Naproche System.- On the Saturation of YAGO.- Description Logic II.- Optimized Description Logic Reasoning via Core Blocking.- An Extension of Complex Role Inclusion Axioms in the Description Logic .- Termination.- Decreasing Diagrams and Relative Termination.- Monotonicity Criteria for Polynomial Interpretations over the Naturals.- Termination Tools in Ordered Completion.