Relational and Algebraic Methods in Computer Science

1. Front Matter

   Pages i-xvii

   PDF

2. Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many Components

   • Stefano Aguzzoli, Matteo Bianchi

   Pages 1-18

3. Unary-Determined Distributive \(\ell \)-magmas and Bunched Implication Algebras

   • Natanael Alpay, Peter Jipsen, Melissa Sugimoto

   Pages 19-36

4. Effect Algebras, Girard Quantales and Complementation in Separation Logic

   • Callum Bannister, Peter Höfner, Georg Struth

   Pages 37-53

5. Relational Computation of Sets of Relations

   • Rudolf Berghammer

   Pages 54-71

6. Experimental Investigation of Sufficient Criteria for Relations to Have Kernels

   • Rudolf Berghammer, Mitja Kulczynski

   Pages 72-89

7. \(\ell r\)-Multisemigroups, Modal Quantales and the Origin of Locality

   • Cameron Calk, Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemiański

   Pages 90-107

8. Abstract Strategies and Coherence

   • Cameron Calk, Eric Goubault, Philippe Malbos

   Pages 108-125

9. Algorithmic Correspondence for Relevance Logics, Bunched Implication Logics, and Relation Algebras via an Implementation of the Algorithm PEARL

   • Willem Conradie, Valentin Goranko, Peter Jipsen

   Pages 126-143

10. The Class of Representable Semilattice-Ordered Monoids Is Not a Variety

    • Amina Doumane

    Pages 144-158

11. Accretive Computation of Global Transformations

    • Alexandre Fernandez, Luidnel Maignan, Antoine Spicher

    Pages 159-175

12. Some Modal and Temporal Translations of Generalized Basic Logic

    • Wesley Fussner, William Zuluaga Botero

    Pages 176-191

13. Isolated Sublattices and Their Application to Counting Closure Operators

    • Roland Glück

    Pages 192-208

14. Second-Order Properties of Undirected Graphs

    • Walter Guttmann

    Pages 209-224

15. Relation-Algebraic Verification of Borůvka’s Minimum Spanning Tree Algorithm

    • Walter Guttmann, Nicolas Robinson-O’Brien

    Pages 225-240

16. Deciding FO-definability of Regular Languages

    • Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev

    Pages 241-257

17. Relational Models for the Lambek Calculus with Intersection and Unit

    • Stepan L. Kuznetsov

    Pages 258-274

18. Free Modal Riesz Spaces are Archimedean: A Syntactic Proof

    • Christophe Lucas, Matteo Mio

    Pages 275-291

19. Polyadic Spaces and Profinite Monoids

    • Jérémie Marquès

    Pages 292-308

20. Time Warps, from Algebra to Algorithms

    • Sam van Gool, Adrien Guatto, George Metcalfe, Simon Santschi

    Pages 309-324

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. 

• boolean algebra
• category theory
• computer systems
• constraint satisfaction
• databases
• formal logic
• fuzzy sets
• graph theory
• image processing
• Kleene algebra
• knowledge-based system
• Lambek calculus
• lattice theory
• mathematical foundations
• matrix algebra
• program correctness
• relation algebra
• semantics
• signal processing
• universal algebra

• École polytechnique, Palaiseau, France

  Uli Fahrenberg

• Université Côte d’Azur, Nice, France

  Mai Gehrke

• Aix-Marseille University, Marseille, France

  Luigi Santocanale

• Brock University, St Catharines, Canada

  Michael Winter

Policies and ethics