default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th RAMiCS 2021: Marseille, France
- Uli Fahrenberg, Mai Gehrke, Luigi Santocanale, Michael Winter:
Relational and Algebraic Methods in Computer Science - 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021, Proceedings. Lecture Notes in Computer Science 13027, Springer 2021, ISBN 978-3-030-88700-1 - Stefano Aguzzoli, Matteo Bianchi
:
Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many Components. 1-18 - Natanael Alpay, Peter Jipsen, Melissa Sugimoto:
Unary-Determined Distributive ℓ-magmas and Bunched Implication Algebras. 19-36 - Callum Bannister, Peter Höfner, Georg Struth:
Effect Algebras, Girard Quantales and Complementation in Separation Logic. 37-53 - Rudolf Berghammer:
Relational Computation of Sets of Relations. 54-71 - Rudolf Berghammer, Mitja Kulczynski:
Experimental Investigation of Sufficient Criteria for Relations to Have Kernels. 72-89 - Cameron Calk, Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemianski:
ℓ r-Multisemigroups, Modal Quantales and the Origin of Locality. 90-107 - Cameron Calk, Eric Goubault, Philippe Malbos:
Abstract Strategies and Coherence. 108-125 - Willem Conradie, Valentin Goranko, Peter Jipsen:
Algorithmic Correspondence for Relevance Logics, Bunched Implication Logics, and Relation Algebras via an Implementation of the Algorithm PEARL. 126-143 - Amina Doumane:
The Class of Representable Semilattice-Ordered Monoids Is Not a Variety. 144-158 - Alexandre Fernandez, Luidnel Maignan, Antoine Spicher:
Accretive Computation of Global Transformations. 159-175 - Wesley Fussner, William Javier Zuluaga Botero:
Some Modal and Temporal Translations of Generalized Basic Logic. 176-191 - Roland Glück:
Isolated Sublattices and Their Application to Counting Closure Operators. 192-208 - Walter Guttmann:
Second-Order Properties of Undirected Graphs. 209-224 - Walter Guttmann, Nicolas Robinson-O'Brien:
Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm. 225-240 - Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev:
Deciding FO-definability of Regular Languages. 241-257 - Stepan L. Kuznetsov:
Relational Models for the Lambek Calculus with Intersection and Unit. 258-274 - Christophe Lucas, Matteo Mio:
Free Modal Riesz Spaces are Archimedean: A Syntactic Proof. 275-291 - Jérémie Marquès:
Polyadic Spaces and Profinite Monoids. 292-308 - Sam van Gool, Adrien Guatto, George Metcalfe, Simon Santschi:
Time Warps, from Algebra to Algorithms. 309-324 - Bernhard Möller, Peter W. O'Hearn, Tony Hoare:
On Algebra of Program Correctness and Incorrectness. 325-343 - Matthias Naaf:
Computing Least and Greatest Fixed Points in Absorptive Semirings. 344-361 - Chad Nester:
A Variety Theorem for Relational Universal Algebra. 362-377 - Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. 378-395 - Luigi Santocanale:
Skew Metrics Valued in Sugihara Semigroups. 396-412 - Carlos Pinzón, Santiago Quintero, Sergio Ramírez, Frank Valencia:
Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge. 413-432 - Michael Winter:
Relational Sums and Splittings in Categories of L-fuzzy Relations. 433-447 - Michael Winter:
Change of Base Using Arrow Categories. 448-464 - Kangfeng Ye, Simon Foster, Jim Woodcock:
Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving. 465-482 - Jas Semrl:
Domain Range Semigroups and Finite Representations. 483-498
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
