Cantitate/Preț
Produs
Total produse
Vezi coșul
Relational and Algebraic Methods in Computer Science: 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings de Uli Fahrenberg

Relational and Algebraic Methods in Computer Science: 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings: Lecture Notes in Computer Science, cartea 13027

Editat de Uli Fahrenberg, Mai Gehrke, Luigi Santocanale, Michael Winter
en Limba Engleză Paperback – 13 oct 2021
This book constitutes the proceedings of the 19th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2021, which took place in Marseille, France, during November 2-5, 2021. 

The 29 papers presented in this book were carefully reviewed and selected from 35 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47593 lei

Preț vechi: 59492 lei
-20% Nou

Puncte Express: 714
Preț estimativ în valută:
9107€ • 9618$ • 7579£

Carte tipărită la comandă

Livrare economică 13-27 ianuarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030887001
ISBN-10: 3030887006
Pagini: 499
Ilustrații: XVII, 499 p. 129 illus., 54 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.72 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Unary-determined distributive l-magmas and bunched implication algebras.- Effect Algebras, Girard Quantales and Complementation in Separation Logic.- Relational Computation of Sets of Relations.- Experimental Investigation of Su cient Criteria for Relations to Have Kernels.- lr-Multisemigroups, Modal Quantales and the Origin of Locality.- Abstract Strategies and Coherence.- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm PEARL.- The class of representable semilattice-ordered monoids is not a variety.- Accretive Computation of Global Transformations.- Some modal and temporal translations of generalized basic logic.- Isolated Sublattices and their Application to Counting Closure Operators.- Second-Order Properties of Undirected Graphs.- Relation-algebraic Verification of Bor uvka's Minimum Spanning Tree Algorithm.- Deciding FO-definability of Regular Languages.- Relational Models for the Lambek calculus with Intersection and Unit.- Free Modal Riesz Spaces are Archimedean: a Syntactic Proof.- Polyadic spaces and profinite monoids.- Time Warps, from Algebra to Algorithms.- On Algebra of Program Correctness and Incorrectness.- Computing Least and Greatest Fixed Points in Absorptive Semirings.- A Variety Theorem for Relational Universal Algebra. -On Tools for Completeness of Kleene Algebra with Hypotheses. -Skew metrics valued in Sugihara semigroups.- Computing Aggregated Knowledge as the Greatest Lower Bound of Knowledge.- Relational Sums and Splittings in Categories of L-fuzzy Relations.- Change of Base using Arrow Categories.- Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving.- Domain Range Semigroups and Finite Representations.