Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic-Based Program Synthesis and Transformation: 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings de Robert Glück

Logic-Based Program Synthesis and Transformation: 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings: Lecture Notes in Computer Science, cartea 14330

Editat de Robert Glück, Bishoksan Kafle
en Limba Engleză Paperback – 16 oct 2023
This book constitutes the refereed proceedings of the 33rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2023, held in Cascais, Portugal, during October 23-24, 2023. 
The 8 full papers and 4 short papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Horn Clauses Analysis, Transformation and Synthesis; Static analysis and Type systems; Unification and substitution in (C)LP; and Knowledge representation and AI-based learning.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32217 lei

Preț vechi: 40272 lei
-20% Nou

Puncte Express: 483
Preț estimativ în valută:
6165€ • 6486$ • 5104£

Carte tipărită la comandă

Livrare economică 14-28 ianuarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783031457838
ISBN-10: 3031457838
Ilustrații: XII, 211 p. 45 illus., 11 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.32 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

K​eynotes.- Unification modulo equational theories in languages with binding operators.- Horn Clauses Analysis, Transformation and Synthesis.- Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples.- Transforming big-step to small-step semantics using interpreter specialisation.- Constrained Horn Clauses Satisfiability via Catamorphic Abstractions.- Static analysis and Type systems.- A reusable machine-calculus for automated resource analyses.- Approach for Designing and Composing Abstract Domains.- A Logical Interpretation of Asynchronous Multiparty Compatibility.- Relational Solver for Java Generics Type System.- Unification and substitution in (C)LP.- Predicate Anti-unification in (Constraint) Logic Programming.- A term matching algorithm and substitution generality.- Knowledge representation and AI-based learning.- A novel EGs-based framework forsystematic propositional-formula simplification.- From Static to Dynamic Access Control Policies via Attribute-Based Category Mining.- Towards a Certified Proof Checker for Deep Neural Network Verification.