Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Relational and Algebraic Methods in Computer Science -

Relational and Algebraic Methods in Computer Science

21st International Conference, RAMiCS 2024, Prague, Czech Republic, August 19–22, 2024, Proceedings
Buch | Softcover
X, 261 Seiten
2024 | 2024
Springer International Publishing (Verlag)
978-3-031-68278-0 (ISBN)
CHF 86,85 inkl. MwSt

This book constitutes the refereed proceedings of the 21st International Conference, RAMiCS 2024, held in Prague, Czech Republic, during August 19-22, 2024.

The 15 full papers presented in this book were carefully reviewed and selected from 21 submissions. They focus on mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.

Tabular and Pretabular Varieties of MTL-algebras.- Cyclic Group Spectra for Some Small Relation Algebras.-Presenting Interval Pomsets with Interfaces.- Irrationality of Process Replication for Higher-Dimensional Automata.- Monotone -Sup-Fuzzy Relations: Converse and Complementation.- On the Structure of Balanced Residuated Partially-ordered Monoids.- Complete Congruences of Completely Distributive Lattices.- A Matrix-oriented View of Bisimulations Quotients over Dioid-labeled Transition Systems.- Restructuring a Concurrent Refinement Algebra.- Frames and Spaces for Distributive Quasi Relation Algebras and Involutive FL-algebras.- Data Migration under a Changing Schema in Ampersand.- Using Matrix Sparsification to Solve Tropical Linear Vector Equations.- Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops.- L-Fuzzy Weak Preference, Preference, and Choice Relations.- Lifting Star-autonomy.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo X, 261 p. 28 illus., 11 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Themenwelt Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Schlagworte Algorithm design • Automata • automated reasoning • Concurrency • Formal Languages • Games • Kleene algebras • network protocol analysis • networks and programming languages • optimisation and control • Program Logics • quantales • Relation algebras • Residuated lattices • semigroups • Semirings • Social Choice
ISBN-10 3-031-68278-5 / 3031682785
ISBN-13 978-3-031-68278-0 / 9783031682780
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Eine kurze Geschichte der Informationsnetzwerke von der Steinzeit bis …

von Yuval Noah Harari

Buch | Hardcover (2024)
Penguin (Verlag)
CHF 39,20