Cantitate/Preț
Produs

Practical Aspects of Declarative Languages: 26th International Symposium, PADL 2024, London, UK, January 15–16, 2024, Proceedings: Lecture Notes in Computer Science, cartea 14512

Editat de Martin Gebser, Ilya Sergey
en Limba Engleză Paperback – 10 ian 2024
This book constitutes the refereed proceedings of the 26th International Conference on Practical Aspects of Declarative Languages, PADL 2024, held in London, UK, during January 17–19, 2024.

The 13 full papers included in this book were carefully reviewed and selected from 25 submissions. The accepted papers span a range of topics related to functional and logic programming, including reactive programming, hardware implementations, implementation of marketplaces, query languages, and applications of declarative programming techniques to artificial intelligence and machine learning.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37871 lei

Preț vechi: 47339 lei
-20% Nou

Puncte Express: 568

Preț estimativ în valută:
7248 7529$ 6020£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031520372
ISBN-10: 3031520378
Pagini: 223
Ilustrații: XVI, 223 p. 64 illus., 39 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.34 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

​Invited Talks.- Whats and Whys of Neural Network Verification (A Declarative Programming Perspective).- Modular Higher-Order Effects.- Regular Papers.- Forget and Regeneration Techniques for Optimizing ASP-based Stream Reasoning.- Asynchronous Reactive Programming with Modal Types in Haskell.- FOLD-SE: An Efficient Rule-based Machine Learning Algorithm with Scalable Explainability.- Marketplace Logistics via Answer Set Programming.- Rhyme: A Data-Centric Expressive Query Language for Nested Data Structures.- Rethinking Answer Set Programming Templates.- Cutting the Cake Into Crumbs: Verifying Envy-Free Cake-Cutting Protocols using Bounded Integer Arithmetic.- A direct ASP Encoding for Declare.- Using Logic Programming and Kernel-Grouping for Improving Interpretability of Convolutional Neural Networks.- Hardware implementation of OCaml using a synchronous functional language.- Ontological Reasoning over Shy and Warded Datalog+/- for Streaming-based Architectures.- Explanation and Knowledge Acquisition in Ad Hoc Teamwork.- Automated Interactive Domain-Specific Conversational Agents that Understand Human Dialogs.