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

Probability monads with submonads of deterministic states 带有确定性状态子单子的概率单子

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

Sean K. Moss, Paolo Perrone

引用次数: 5

When Locality Meets Preservation 当地方与保存相遇

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

Aliaume Lopez

引用次数: 0

Graded Monads and Behavioural Equivalence Games 分级单子和行为等价游戏

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-03-29 DOI: 10.1145/3531130.3533374

Harsh Beohar, Chase Ford, B. König, Stefan Milius, Lutz Schröder

引用次数: 5

Curry and Howard Meet Borel 库里和霍华德遇见了博雷尔

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-03-21 DOI: 10.1145/3531130.3533361

Melissa Antonelli, Ugo Dal Lago, Paolo Pistone

引用次数: 7

The Regular Languages of First-Order Logic with One Alternation 一类一阶逻辑的正则语言

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-03-11 DOI: 10.1145/3531130.3533371

Corentin Barloy, M. Cadilhac, Charles Paperman, T. Zeume

引用次数: 1

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes 定维容器中可达性问题的下界

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

Wojciech Czerwi'nski, Lukasz Orlikowski

引用次数: 8

Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics 半环语义中一阶逻辑的零- 1定律和几乎肯定赋值

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-03-07 DOI: 10.1145/3531130.3533358

E. Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke

{"title":"Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics","authors":"E. Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke","doi":"10.1145/3531130.3533358","DOIUrl":"https://doi.org/10.1145/3531130.3533358","url":null,"abstract":"Semiring semantics evaluates logical statements by values in some commutative semiring (K, +, ·, 0, 1). Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how classical results on first-order logic on random structures, most importantly the 0-1 laws of Glebskii et al. and Fagin, generalise to semiring semantics. For positive semirings, the classical 0-1 law implies that every first-order sentence is, asymptotically, either almost surely evaluated to 0 by random semiring interpretations, or almost surely takes only values different from 0. However, by means of a more sophisticated analysis, based on appropriate extension properties and on algebraic representations of first-order formulae, we can prove much stronger results. For many semirings K the first-order sentences in FO(τ) can be partitioned into classes (Φj)j ∈ K such that for each j ∈ K, every sentence in Φj evaluates almost surely to j under random semiring interpretations. Further, for finite or infinite lattice semirings, this partition actually collapses to just three classes Φ0, Φ1, and Φε, of sentences that, respectively, almost surely evaluate to 0, 1, and to the smallest value ε ≠ 0. For all other values j ∈ K we have that . The problem of computing the almost sure valuation of a first-order sentence on finite lattice semirings is Pspace-complete. Related version: All proofs can be found in the full version of this paper, available at https://arxiv.org/abs/2203.03425.","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133236625","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}

引用次数: 6

Stochastic Games with Synchronizing Objectives 具有同步目标的随机博弈

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

L. Doyen

{"title":"Stochastic Games with Synchronizing Objectives","authors":"L. Doyen","doi":"10.1145/3531130.3532439","DOIUrl":"https://doi.org/10.1145/3531130.3532439","url":null,"abstract":"We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding stochasticity. The outcome of the game is a sequence of distributions over the states of the game graph. We consider synchronizing objectives, which require the probability mass to accumulate in a set of target states, either always, once, infinitely often, or always after some point in the outcome sequence; and the winning modes of sure winning (if the accumulated probability is equal to 1) and almost-sure winning (if the accumulated probability is arbitrarily close to 1). We present algorithms to compute the set of winning distributions for each of these synchronizing modes, showing that the corresponding decision problem is PSPACE-complete for synchronizing once and infinitely often, and PTIME-complete for synchronizing always and always after some point. These bounds are remarkably in line with the special case of MDPs, while the algorithmic solution and proof technique are considerably more involved, even for deterministic games. This is because those games have a flavour of imperfect information, in particular they are not determined and randomized strategies need to be considered, even if there is no stochastic choice in the game graph. Moreover, in combination with stochasticity in the game graph, finite-memory strategies are not sufficient in general (for synchronizing infinitely often).","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127560130","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

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth 局部有界团宽度类解释的模型检验

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

'Edouard Bonnet, Jannik Dreier, Jakub Gajarsk'y, S. Kreutzer, Nikolas Mahlmann, Pierre Simon, Szymon Toruńczyk

引用次数: 5

Identity Testing for Radical Expressions 根式表达式的同一性测试

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

N. Balaji, Klara Nosan, M. Shirmohammadi, J. Worrell

引用次数: 1