Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Relational and Algebraic Methods in Computer Science

19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021, Proceedings
BuchKartoniert, Paperback
499 Seiten
Englisch
Springererschienen am13.10.20211st ed. 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. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR79,17
BuchKartoniert, Paperback
EUR62,05
E-BookPDF1 - PDF WatermarkE-Book
EUR78,10

Produkt

KlappentextThis 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. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms.
Details
ISBN/GTIN978-3-030-88700-1
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2021
Erscheinungsdatum13.10.2021
Auflage1st ed. 2021
Seiten499 Seiten
SpracheEnglisch
IllustrationenXVII, 499 p. 129 illus., 54 illus. in color.
Artikel-Nr.50083786

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Schlagworte