Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第5页

Efficient Construction of Reversible Transducers from Regular Transducer Expressions 从正则换能器表达式高效构造可逆换能器

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-02-09 DOI: 10.1145/3531130.3533364

L. Dartois, P. Gastin, R. Govind, S. Krishna

引用次数: 2

The amazing mixed polynomial closure and its applications to two-variable first-order logic 惊人的混合多项式闭包及其在两变量一阶逻辑中的应用

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-02-08 DOI: 10.1145/3531130.3532410

Thomas Place

{"title":"The amazing mixed polynomial closure and its applications to two-variable first-order logic","authors":"Thomas Place","doi":"10.1145/3531130.3532410","DOIUrl":"https://doi.org/10.1145/3531130.3532410","url":null,"abstract":"Polynomial closure is a standard operator which is applied to a class of regular languages. In this paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while MPol is new. We look at two decision problems that are defined for every class . Membership takes a regular language as input and asks if it belongs to . Separation takes two regular languages as input and asks if there exists a third language in including the first one and disjoint from the second. We prove that LPol, RPol and MPol preserve the decidability of membership under mild hypotheses on the input class, and the decidability of separation under much stronger hypotheses. We apply these results to natural hierarchies. First, we look at several language theoretic hierarchies that are built by applying LPol, RPol and MPol recursively to a single input class. We prove that these hierarchies can actually be defined using almost exclusively MPol. We also consider quantifier alternation hierarchies for two-variable first-order logic (FO2) and prove that one can climb them using MPol. The result is generic in the sense that it holds for most standard choices of signatures. We use it to prove that for most of these choices, membership is decidable for all levels in the hierarchy. Finally, we prove that separation is decidable for the hierarchy of two-variable first-order logic equipped with only the linear order (FO2(<)).","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122420341","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

Monoidal Streams for Dataflow Programming 数据流编程的单轴流

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-02-04 DOI: 10.1145/3531130.3533365

Elena Di Lavore, G. Felice, Mario Rom'an

引用次数: 7

Treelike Decompositions for Transductions of Sparse Graphs 稀疏图转导的树状分解

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-26 DOI: 10.1145/3531130.3533349

Jannik Dreier, Jakub Gajarsk'y, Sandra Kiefer, Michal Pilipczuk, Szymon Toruńczyk

引用次数: 8

Quantum Expectation Transformers for Cost Analysis 用于成本分析的量子期望转换器

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-23 DOI: 10.1145/3531130.3533332

Martin Avanzini, G. Moser, Romain Péchoux, S. Perdrix, Vladimir Zamdzhiev

引用次数: 1

Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning 数量代数推理中的超越非扩张运算

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-22 DOI: 10.1145/3531130.3533366

M. Mio, Ralph Sarkis, Valeria Vignudelli

引用次数: 5

Solvability of orbit-finite systems of linear equations 轨道有限线性方程组的可解性

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-22 DOI: 10.1145/3531130.3533333

Arka P. Ghosh, Piotr Hofman, S. Lasota

引用次数: 2

The complexity of soundness in workflow nets 工作流网络健全的复杂性

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-14 DOI: 10.1145/3531130.3533341

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

引用次数: 2

Temporal Team Semantics Revisited 重新审视时态团队语义

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2021-10-25 DOI: 10.1145/3531130.3533360

J. Gutsfeld, A. Meier, Christoph Ohrem, J. Virtema

引用次数: 6

The Pebble-Relation Comonad in Finite Model Theory 有限模型理论中常见的卵石关系

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2021-10-15 DOI: 10.1145/3531130.3533335

Yoàv Montacute, Nihil Shah

{"title":"The Pebble-Relation Comonad in Finite Model Theory","authors":"Yoàv Montacute, Nihil Shah","doi":"10.1145/3531130.3533335","DOIUrl":"https://doi.org/10.1145/3531130.3533335","url":null,"abstract":"The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory. The coKleisli category of the pebbling comonad specifies equivalences under different fragments and extensions of infinitary k-variable logic. Moreover, the coalgebras over this pebbling comonad characterise treewidth and correspond to tree decompositions. In this paper we introduce the pebble-relation comonad, which characterises pathwidth and whose coalgebras correspond to path decompositions. We further show that the existence of a coKleisli morphism in this comonad is equivalent to truth preservation in the restricted conjunction fragment of k-variable infinitary logic. We do this using Dalmau’s pebble-relation game and an equivalent all-in-one pebble game. We then provide a similar treatment to the corresponding coKleisli isomorphisms via a bijective version of the all-in-one pebble game with a hidden pebble placement. Finally, we show as a consequence a new Lovász-type theorem relating pathwidth to the restricted conjunction fragment of k-variable infinitary logic with counting quantifiers.","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124497138","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}

引用次数: 14