Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第7页

Sound up-to techniques and Complete abstract domains 完善的技术和完整的抽象领域

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-27 DOI: 10.1145/3209108.3209169

F. Bonchi, P. Ganty, R. Giacobazzi, Dusko Pavlovic

引用次数: 12

A theory of linear typings as flows on 3-valent graphs 3价图上的线性类型流理论

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-27 DOI: 10.1145/3209108.3209121

N. Zeilberger

{"title":"A theory of linear typings as flows on 3-valent graphs","authors":"N. Zeilberger","doi":"10.1145/3209108.3209121","DOIUrl":"https://doi.org/10.1145/3209108.3209121","url":null,"abstract":"Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or \"maps\"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is the classical notion of an abelian group-valued \"flow\" on an abstract graph (Tutte, 1954). Typing a linear lambda term may be naturally seen as constructing a flow (on an embedded 3-valent graph with boundary) valued in a more general algebraic structure consisting of a preordered set equipped with an \"implication\" operation and unit satisfying composition, identity, and unit laws. Interesting questions and results from the theory of flows (such as the existence of nowhere-zero flows) may then be re-examined from the standpoint of lambda calculus and logic. For example, we give a characterization of when the local flow relations (across vertices) may be categorically lifted to a global flow relation (across the boundary), proving that this holds just in case the underlying map has the orientation of a lambda term. We also develop a basic theory of rewriting of flows that suggests topological meanings for classical completeness results in combinatory logic, and introduce a polarized notion of flow, which draws connections to the theory of proof-nets in linear logic and to bidirectional typing.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840725","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}

引用次数: 12

Weighted model counting beyond two-variable logic 超越两变量逻辑的加权模型计数

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-26 DOI: 10.1145/3209108.3209168

Antti Kuusisto, C. Lutz

引用次数: 26

Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams 丰富线性/非线性Lambda演算:一种用于字符串图的编程语言

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-25 DOI: 10.1145/3209108.3209196

B. Lindenhovius, M. Mislove, Vladimir Zamdzhiev

引用次数: 24

Distribution-based objectives for Markov Decision Processes 基于分布的马尔可夫决策过程目标

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-25 DOI: 10.1145/3209108.3209185

S. Akshay, B. Genest, Nikhil Vyas

{"title":"Distribution-based objectives for Markov Decision Processes","authors":"S. Akshay, B. Genest, Nikhil Vyas","doi":"10.1145/3209108.3209185","DOIUrl":"https://doi.org/10.1145/3209108.3209185","url":null,"abstract":"We consider distribution-based objectives for Markov Decision Processes (MDP). This class of objectives gives rise to an interesting trade-off between full and partial information. As in full observation, the strategy in the MDP can depend on the state of the system, but similar to partial information, the strategy needs to account for all the states at the same time. In this paper, we focus on two safety problems that arise naturally in this context, namely, existential and universal safety. Given an MDP A and a closed and convex polytope H of probability distributions over the states of A, the existential safety problem asks whether there exists some distribution Δ in H and a strategy of A, such that starting from Δ and repeatedly applying this strategy keeps the distribution forever in H. The universal safety problem asks whether for all distributions in H, there exists such a strategy of A which keeps the distribution forever in H. We prove that both problems are decidable, with tight complexity bounds: we show that existential safety is PTIME-complete, while universal safety is co-NP-complete. Further, we compare these results with existential and universal safety problems for Rabin's probabilistic finite-state automata (PFA), the subclass of Partially Observable MDPs which have zero observation. Compared to MDPs, strategies of PFAs are not state-dependent. In sharp contrast to the PTIME result, we show that existential safety for PFAs is undecidable, with H having closed and open boundaries. On the other hand, it turns out that the universal safety for PFAs is decidable in EXPTIME, with a co-NP lower bound. Finally, we show that an alternate representation of the input polytope allows us to improve the complexity of universal safety for MDPs and PFAs.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133267573","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}

引用次数: 10

Guarded Computational Type Theory 保守计算类型理论

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-04-24 DOI: 10.1145/3209108.3209153

Jonathan Sterling, R. Harper

引用次数: 11

Regular and First-Order List Functions 正则和一阶列表函数

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-03-16 DOI: 10.1145/3209108.3209163

M. Bojanczyk, Laure Daviaud, Krishna Shankara Narayanan

引用次数: 20

Definable decompositions for graphs of bounded linear cliquewidth 有界线性团宽图的可定义分解

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-03-15 DOI: 10.1145/3209108.3209135

M. Bojanczyk, Martin Grohe, Michal Pilipczuk

引用次数: 5

A pseudo-quasi-polynomial algorithm for mean-payoff parity games 平均收益奇偶博弈的伪拟多项式算法

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-03-13 DOI: 10.1145/3209108.3209162

Laure Daviaud, M. Jurdzinski, R. Lazic

{"title":"A pseudo-quasi-polynomial algorithm for mean-payoff parity games","authors":"Laure Daviaud, M. Jurdzinski, R. Lazic","doi":"10.1145/3209108.3209162","DOIUrl":"https://doi.org/10.1145/3209108.3209162","url":null,"abstract":"In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff. Our main technical result is a pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. All algorithms for the problem that have been developed for over a decade have a pseudo-polynomial and an exponential factors in their running times; in the running time of our algorithm the latter is replaced with a quasi-polynomial one. By the results of Chatterjee and Doyen (2012) and of Schewe, Weinert, and Zimmermann (2018), our main technical result implies that there are pseudo-quasi-polynomial algorithms for solving parity energy games and for solving parity games with weights. Our main conceptual contributions are the definitions of strategy decompositions for both players, and a notion of progress measures for mean-payoff parity games that generalizes both parity and energy progress measures. The former provides normal forms for and succinct representations of winning strategies, and the latter enables the application to mean-payoff parity games of the order-theoretic machinery that underpins a recent quasi-polynomial algorithm for solving parity games.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116804007","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}

引用次数: 20

Playing with Repetitions in Data Words Using Energy Games 使用能量游戏玩重复的数据单词

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2018-02-21 DOI: 10.1145/3209108.3209154

Diego Figueira, M. Praveen

{"title":"Playing with Repetitions in Data Words Using Energy Games","authors":"Diego Figueira, M. Praveen","doi":"10.1145/3209108.3209154","DOIUrl":"https://doi.org/10.1145/3209108.3209154","url":null,"abstract":"We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables ranging over an infinite data domain, thus generating multi-attributed data words. The winner of the game is specified by formulas in the Logic of Repeating Values, which can reason about repetitions of data values in infinite data words. We prove that it is undecidable to check if one of the players has a winning strategy, even in very restrictive settings. However, we prove that if one of the players is restricted to choose valuations ranging over the Boolean domain, the games are effectively equivalent to single-sided games on vector addition systems with states (in which one of the players can change control states but cannot change counter values), known to be decidable and effectively equivalent to energy games. Previous works have shown that the satisfiability problem for various variants of the logic of repeating values is equivalent to the reachability and coverability problems in vector addition systems. Our results raise this connection to the level of games, augmenting further the associations between logics on data words and counter systems.","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507065","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}

引用次数: 9