Cantitate/Preț
Produs

Frontiers of Combining Systems: 13th International Symposium, FroCoS 2021, Birmingham, UK, September 8–10, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12941

Editat de Boris Konev, Giles Reger
en Limba Engleză Paperback – sep 2021
This book constitutes the refereed proceedings of the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021, held in Birmingham, UK, in September 2021.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49602 lei

Preț vechi: 62003 lei
-20% Nou

Puncte Express: 744

Preț estimativ în valută:
9493 9889$ 7893£

Carte tipărită la comandă

Livrare economică 10-24 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030862046
ISBN-10: 3030862046
Pagini: 307
Ilustrații: XVI, 307 p. 41 illus., 19 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.45 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

Calculi and Unification.- A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic.- Non-Disjoint Combined Unification and Closure by Equational Paramodulation.- Symbol Elimination and Applications to Parametric Entailment Problems.- On the copy complexity of width 3 Horn constraint systems.- Description Logics Restricted Unification in the Description Logic FL0.- Combining Event Calculus and Description Logic Reasoning via Logic Programming.- Semantic Forgetting in Expressive Description Logics.- Interactive Theorem Proving Improving Automation for Higher-order Proof Steps.- JEFL: Joint Embedding of Formal Proof Libraries.- Machine Learning Fast and Slow Enigmas and Parental Guidance.- Vampire With a Brain Is a Good ITP Hammer.- Satisfiability Modulo Theories Optimization Modulo Non-Linear Arithmetic via Incremental Linearization.- Quantifier Simplification by Unification in SMT.- Verification Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems.- Formal Analysis of Symbolic Authenticity.- Formal Verification of a Java Component Using the RESOLVE Framework.