Automated Deduction -- CADE-24 de Maria Paola Bonacina

Automated Deduction -- CADE-24: 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings: Lecture Notes in Computer Science, cartea 7898

Maria Paola Bonacina

en Limba Engleză Paperback – 16 mai 2013

This book constitutes the proceedings of the 24th International Conference on Automated Deduction, CADE-24, held in Lake Placid, NY, USA, in June 2013.The 31 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 71 initial submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, ranging from theoretical and methodological issues to the presentation of new theorem provers, solvers and systems.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1061^.55 lei
20%

Preț: 341^.95 lei
20%

Preț: 369^.12 lei
20%

Preț: 645^.28 lei
20%

Preț: 591^.51 lei
15%

Preț: 580^.46 lei
Preț: 410^.88 lei
20%

Preț: 504^.57 lei
Preț: 381^.21 lei
20%

Preț: 340^.32 lei
20%

Preț: 1414^.79 lei
20%

Preț: 538^.29 lei
20%

Preț: 583^.40 lei
20%

Preț: 1075^.26 lei
20%

Preț: 238^.01 lei
17%

Preț: 360^.19 lei
20%

Preț: 438^.69 lei
20%

Preț: 1183^.14 lei
20%

Preț: 596^.46 lei
15%

Preț: 438^.59 lei
20%

Preț: 655^.02 lei
20%

Preț: 649^.49 lei
20%

Preț: 309^.90 lei
20%

Preț: 337^.00 lei
Preț: 449^.57 lei
20%

Preț: 310^.26 lei
20%

Preț: 1024^.44 lei
20%

Preț: 579^.30 lei
20%

Preț: 763^.23 lei
20%

Preț: 453^.32 lei
20%

Preț: 575^.48 lei
20%

Preț: 585^.88 lei
20%

Preț: 326^.98 lei
20%

Preț: 825^.93 lei
17%

Preț: 427^.22 lei
20%

Preț: 763^.23 lei
20%

Preț: 350^.21 lei
20%

Preț: 307^.71 lei
20%

Preț: 580^.93 lei
20%

Preț: 340^.32 lei
20%

Preț: 343^.62 lei
20%

Preț: 583^.40 lei
20%

Preț: 583^.40 lei
Preț: 389^.48 lei
20%

Preț: 353^.50 lei
20%

Preț: 607^.39 lei

Specificații

ISBN-13: 9783642385735
ISBN-10: 3642385737
Pagini: 484
Ilustrații: XVI, 466 p. 95 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

One Logic to Use Them All.- The Tree Width of Separation Logic with Recursive Definitions.- Hierarchic Superposition with Weak Abstraction.- Completeness and Decidability Results for First-Order Clauses with Indices.- A Proof Procedure for Hybrid Logic with Binders, Transitivity andRelation Hierarchies.- Tractable Inference Systems: An Extension with a Deducibility Predicate.- Computing Tiny Clause Normal Forms.- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic.- Analysing Vote Counting Algorithms via Logic: And Its Applicationto the CADE Election Scheme.- Automated Reasoning, Fast and Slow.- Foundational Proof Certificates in First-Order Logic.- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals.- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition.- dReal: An SMT Solver for Nonlinear Theories over the Reals.- Solving Difference Constraints over Modular Arithmetic.- Asymmetric Unification: A New Unification Paradigm for CryptographicProtocol Analysis.- Hierarchical Combination.- PRocH: Proof Reconstruction for HOL Light.- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description.- Towards Modularly Comparing Programs Using Automated Theorem Provers.- Reuse in Software Verification by Abstract Method Calls.- Dynamic Logic with Trace Semantics.- Temporalizing Ontology-Based Data Access.- Verifying Refutations with Extended Resolution.- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems.- Quantifier Instantiation Techniques for Finite Model Finding in SMT.- Automating Inductive Proofs Using Theory Exploration.- E-MaLeS 1.1.- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism.- Propositional Temporal Proving with Reductions to a SAT Problem.- InKreSAT: Modal Reasoning via Incremental Reduction to SAT.- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR.- The 481 Ways to Split a Clause and Deal with Propositional Variables.