![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2021
- Stefano Aguzzoli, Matteo Bianchi
:
Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many Components. RAMiCS 2021: 1-18 - Natanael Alpay
, Peter Jipsen
, Melissa Sugimoto:
Unary-Determined Distributive ℓ-magmas and Bunched Implication Algebras. RAMiCS 2021: 19-36 - Callum Bannister, Peter Höfner, Georg Struth:
Effect Algebras, Girard Quantales and Complementation in Separation Logic. RAMiCS 2021: 37-53 - Rudolf Berghammer:
Relational Computation of Sets of Relations. RAMiCS 2021: 54-71 - Rudolf Berghammer, Mitja Kulczynski
:
Experimental Investigation of Sufficient Criteria for Relations to Have Kernels. RAMiCS 2021: 72-89 - Cameron Calk, Uli Fahrenberg, Christian Johansen
, Georg Struth, Krzysztof Ziemianski:
ℓ r-Multisemigroups, Modal Quantales and the Origin of Locality. RAMiCS 2021: 90-107 - Cameron Calk, Eric Goubault, Philippe Malbos:
Abstract Strategies and Coherence. RAMiCS 2021: 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. RAMiCS 2021: 126-143 - Amina Doumane:
The Class of Representable Semilattice-Ordered Monoids Is Not a Variety. RAMiCS 2021: 144-158 - Alexandre Fernandez, Luidnel Maignan, Antoine Spicher:
Accretive Computation of Global Transformations. RAMiCS 2021: 159-175 - Wesley Fussner
, William Javier Zuluaga Botero
:
Some Modal and Temporal Translations of Generalized Basic Logic. RAMiCS 2021: 176-191 - Roland Glück
:
Isolated Sublattices and Their Application to Counting Closure Operators. RAMiCS 2021: 192-208 - Sam van Gool, Adrien Guatto, George Metcalfe
, Simon Santschi
:
Time Warps, from Algebra to Algorithms. RAMiCS 2021: 309-324 - Walter Guttmann:
Second-Order Properties of Undirected Graphs. RAMiCS 2021: 209-224 - Walter Guttmann, Nicolas Robinson-O'Brien:
Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm. RAMiCS 2021: 225-240 - Agi Kurucz, Vladislav Ryzhikov, Yury Savateev
, Michael Zakharyaschev
:
Deciding FO-definability of Regular Languages. RAMiCS 2021: 241-257 - Stepan L. Kuznetsov
:
Relational Models for the Lambek Calculus with Intersection and Unit. RAMiCS 2021: 258-274 - Christophe Lucas, Matteo Mio:
Free Modal Riesz Spaces are Archimedean: A Syntactic Proof. RAMiCS 2021: 275-291 - Jérémie Marquès
:
Polyadic Spaces and Profinite Monoids. RAMiCS 2021: 292-308 - Bernhard Möller, Peter W. O'Hearn, Tony Hoare:
On Algebra of Program Correctness and Incorrectness. RAMiCS 2021: 325-343 - Matthias Naaf
:
Computing Least and Greatest Fixed Points in Absorptive Semirings. RAMiCS 2021: 344-361 - Chad Nester:
A Variety Theorem for Relational Universal Algebra. RAMiCS 2021: 362-377 - Carlos Pinzón, Santiago Quintero
, Sergio Ramírez, Frank Valencia:
Computing Distributed Knowledge as the Greatest Lower Bound of Knowledge. RAMiCS 2021: 413-432 - Damien Pous, Jurriaan Rot, Jana Wagemaker:
On Tools for Completeness of Kleene Algebra with Hypotheses. RAMiCS 2021: 378-395 - Luigi Santocanale
:
Skew Metrics Valued in Sugihara Semigroups. RAMiCS 2021: 396-412 - Jas Semrl
:
Domain Range Semigroups and Finite Representations. RAMiCS 2021: 483-498 - Michael Winter:
Relational Sums and Splittings in Categories of L-fuzzy Relations. RAMiCS 2021: 433-447 - Michael Winter:
Change of Base Using Arrow Categories. RAMiCS 2021: 448-464 - Kangfeng Ye
, Simon Foster
, Jim Woodcock
:
Automated Reasoning for Probabilistic Sequential Programs with Theorem Proving. RAMiCS 2021: 465-482 - 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 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-18 04:15 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint