Relational and Algebraic Methods in Computer Science

19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings

AvUli Fahrenberg,Mai Gehrke

Häftad, Engelska, 2021

Del i serien Lecture Notes in Computer Science

801 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2021-10-13
Mått:155 x 235 x 28 mm
Vikt:779 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:499
Förlag:Springer Nature Switzerland AG
ISBN:9783030887001

Utforska kategorier

Matematikens grunder inom Naturvetenskap och teknik
Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

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.