Muutke küpsiste eelistusi

Logic-Based Program Synthesis and Transformation: 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings 1st ed. 2023 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 235x155 mm, kaal: 349 g, 11 Illustrations, color; 34 Illustrations, black and white; XII, 211 p. 45 illus., 11 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14330
  • Ilmumisaeg: 16-Oct-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031457838
  • ISBN-13: 9783031457838
Teised raamatud teemal:
  • Pehme köide
  • Hind: 53,33 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 62,74 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Logic-Based Program Synthesis and Transformation: 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings 1st ed. 2023Suurem pilt
  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 235x155 mm, kaal: 349 g, 11 Illustrations, color; 34 Illustrations, black and white; XII, 211 p. 45 illus., 11 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14330
  • Ilmumisaeg: 16-Oct-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031457838
  • ISBN-13: 9783031457838
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031457838.html
Märksõnad:

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.

Keynotes.- 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.