发布求助
文献互助 智能选刊 最新文献

International Conference on Relational and Algebraic Methods in Computer Science最新文献

筛选
英文 中文
Duoidally enriched Freyd categories 多元丰富的弗雷德分类
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2023-01-12 DOI: 10.1007/978-3-031-28083-2_15
C. Heunen, Jesse Sigal
{"title":"Duoidally enriched Freyd categories","authors":"C. Heunen, Jesse Sigal","doi":"10.1007/978-3-031-28083-2_15","DOIUrl":"https://doi.org/10.1007/978-3-031-28083-2_15","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Representable and diagonally representable weakening relation algebras 可表征和对角可表征弱化关系代数
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2023-01-05 DOI: 10.48550/arXiv.2301.02213
P. Jipsen, Jas Semrl
{"title":"Representable and diagonally representable weakening relation algebras","authors":"P. Jipsen, Jas Semrl","doi":"10.48550/arXiv.2301.02213","DOIUrl":"https://doi.org/10.48550/arXiv.2301.02213","url":null,"abstract":"A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For a fixed poset the collection of weakening relations is a subreduct of the full relation algebra on the underlying set of the poset. We present a two-player game for the class of representable weakening relation algebras akin to that for the class of representable relation algebras. This enables us to define classes of abstract weakening relation algebras that approximate the quasivariety of representable weakening relation algebras. We give explicit finite axiomatisations for some of these classes. We define the class of diagonally representable weakening relation algebras and prove that it is a discriminator variety. We also provide explicit representations for several small weakening relation algebras.","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129815146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Implication Algebras and Implication Semigroups of Binary Relations 二元关系的蕴涵代数与蕴涵半群
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2023-01-05 DOI: 10.1007/978-3-031-28083-2_12
Andrew Lewis-Smith, Jas Semrl
{"title":"Implication Algebras and Implication Semigroups of Binary Relations","authors":"Andrew Lewis-Smith, Jas Semrl","doi":"10.1007/978-3-031-28083-2_12","DOIUrl":"https://doi.org/10.1007/978-3-031-28083-2_12","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134481572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some modal and temporal translations of generalized basic logic 广义基本逻辑的一些模态和时间翻译
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2021-06-10 DOI: 10.1007/978-3-030-88701-8_11
Wesley Fussner, W. Z. Botero
{"title":"Some modal and temporal translations of generalized basic logic","authors":"Wesley Fussner, W. Z. Botero","doi":"10.1007/978-3-030-88701-8_11","DOIUrl":"https://doi.org/10.1007/978-3-030-88701-8_11","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122021318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Domain Range Semigroups and Finite Representations 域范围半群与有限表示
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2021-06-04 DOI: 10.1007/978-3-030-88701-8_29
Jas Semrl
{"title":"Domain Range Semigroups and Finite Representations","authors":"Jas Semrl","doi":"10.1007/978-3-030-88701-8_29","DOIUrl":"https://doi.org/10.1007/978-3-030-88701-8_29","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"749 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115133459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Computing Least and Greatest Fixed Points in Absorptive Semirings 吸收半环最小不动点和最大不动点的计算
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2021-06-01 DOI: 10.1007/978-3-030-88701-8_21
Matthias Naaf
{"title":"Computing Least and Greatest Fixed Points in Absorptive Semirings","authors":"Matthias Naaf","doi":"10.1007/978-3-030-88701-8_21","DOIUrl":"https://doi.org/10.1007/978-3-030-88701-8_21","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116687195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Deciding FO-definability of Regular Languages 决定正则语言的fo可定义性
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2021-05-13 DOI: 10.1007/978-3-030-88701-8_15
Agi Kurucz, V. Ryzhikov, Yury Savateev, M. Zakharyaschev
{"title":"Deciding FO-definability of Regular Languages","authors":"Agi Kurucz, V. Ryzhikov, Yury Savateev, M. Zakharyaschev","doi":"10.1007/978-3-030-88701-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-88701-8_15","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"638 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122952482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Accretive Computation of Global Transformations 全局变换的累加计算
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2021-03-17 DOI: 10.1007/978-3-030-88701-8_10
A. Fernandez, Luidnel Maignan, Antoine Spicher
{"title":"Accretive Computation of Global Transformations","authors":"A. Fernandez, Luidnel Maignan, Antoine Spicher","doi":"10.1007/978-3-030-88701-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-88701-8_10","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129727344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture 角格式，关系代数和挠性原子猜想
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2019-05-28 DOI: 10.1007/978-3-031-28083-2_2
Jeremy F. Alm, David A. Andrews, Michael Levet
{"title":"Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture","authors":"Jeremy F. Alm, David A. Andrews, Michael Levet","doi":"10.1007/978-3-031-28083-2_2","DOIUrl":"https://doi.org/10.1007/978-3-031-28083-2_2","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116820619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Algebraic Derivation of Until Rules and Application to Timer Verification 直到规则的代数推导及其在计时器验证中的应用
International Conference on Relational and Algebraic Methods in Computer Science Pub Date : 2018-10-29 DOI: 10.1007/978-3-030-02149-8_15
Jessica Ertel, Roland Glück, B. Möller
{"title":"Algebraic Derivation of Until Rules and Application to Timer Verification","authors":"Jessica Ertel, Roland Glück, B. Möller","doi":"10.1007/978-3-030-02149-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-02149-8_15","url":null,"abstract":"","PeriodicalId":273640,"journal":{"name":"International Conference on Relational and Algebraic Methods in Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116124737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信