Cantitate/Preț
Produs
Total produse
Vezi coșul
Automated Deduction – CADE 27: 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings de Pascal Fontaine

Automated Deduction – CADE 27: 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11716

Editat de Pascal Fontaine
en Limba Engleză Paperback – 21 aug 2019
This book constitutes the proceeding of the 27th International Conference on Automated Deduction, CADE 27, held in Natal, Brazil, in August 2019.
The 27 full papers and 7 system descriptions presented were carefully reviewed and selected from 65 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience.
 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 54294 lei

Preț vechi: 67868 lei
-20% Nou

Puncte Express: 814
Preț estimativ în valută:
10398€ • 10713$ • 8711£

Carte tipărită la comandă

Livrare economică 22 februarie-08 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030294359
ISBN-10: 3030294358
Pagini: 582
Ilustrații: XXIII, 582 p. 110 illus., 56 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.84 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

Automated Reasoning for Security Protocols.- Computer Deduction and (Formal) Proofs in Mathematics.- From Counter-Model-based Quantifier Instantiation to Quantifier Elimination in SMT.- The CADE-27 ATP System Competition - CASC-27.- Unification modulo Lists with Reverse - Relation with Certain Word Equations.- On the Width of Regular Classes of Finite Structures.- Extending SMT solvers to Higher-Order Logic.- Superposition with Lambdas.- Restricted Combinatory Unification.- dLi: Definite Descriptions in Differential Dynamic Logic.- SPASS-SATT { A CDCL(LA) Solver.- GRUNGE: A Grand Unified ATP Challenge.- Model Completeness, Covers and Superposition.- A Tableaux Calculus for Default Intuitionistic Logic.- NIL: Learning Nonlinear Interpolants.- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E.- Towards Physical Hybrid Systems.- SCL -- Clause Learning from Simple Models.- Names are not just Sound and Smoke: Word Embeddings for Axiom Selection.- Computing Expected Runtimes for Constant Probability Programs.- Automatic Generation of Logical Models with AGES.- Automata Terms in a Lazy WSkS Decision Procedure.- Confluence by Critical Pair Analysis Revisited.- Composing Proof Terms.- Combining ProVerif and Automated Theorem Provers for Security Protocol Verification.- Towards Bit-Width-Independent Proofs in SMT Solvers.- On Invariant Synthesis for Parametric Systems.- The Aspect Calculus.- Uniform Substitution At One Fell Swoop.- A Formally Verified Abstract Account of Gödel's Incompleteness Theorems.- Old or Heavy? Decaying Gracefully with Age/Weight Shapes.- Induction in Saturation-Based Proof Search.- Faster, Higher, Stronger: E 2.3.- Certified Equational Reasoning via Ordered Completion.- JGXYZ - An ATP System for Gap and Glut Logics.- GKC: a Reasoning System for Large Knowledge Bases.- Optimization Modulo the Theory of Floating-Point Numbers.- FAME(Q): An Automated Tool for Forgetting in Description Logics with Qualified Number Restrictions.