2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第5页

An effectful way to eliminate addiction to dependence 消除依赖成瘾的有效方法

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005113

Pierre-Marie Pédrot, Nicolas Tabareau

引用次数: 26

The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems 无限域约束满足问题的两个二分猜想的等价性

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005128

L. Barto, M. Kompatscher, M. Olsák, Trung Van Pham, M. Pinsker

引用次数: 37

Constructive completeness for the linear-time μ-calculus 线性时间μ微积分的构造完备性

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005075

Amina Doumane

引用次数: 21

Logic and regular cost functions 逻辑和常规成本函数

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005061

Thomas Colcombet

引用次数: 3

Riesz Modal logic for Markov processes 马尔可夫过程的Riesz模态逻辑

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005091

M. Mio, Robert Furber, R. Mardare

引用次数: 6

Polynomial automata: Zeroness and applications 多项式自动机:零性及其应用

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005101

Michael Benedikt, Timothy Duff, Aditya Sharad, J. Worrell

引用次数: 22

Strategy logic with imperfect information 不完全信息下的策略逻辑

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-01 DOI: 10.1109/LICS.2017.8005136

Raphaël Berthon, Bastien Maubert, A. Murano, S. Rubin, Moshe Y. Vardi

{"title":"Strategy logic with imperfect information","authors":"Raphaël Berthon, Bastien Maubert, A. Murano, S. Rubin, Moshe Y. Vardi","doi":"10.1109/LICS.2017.8005136","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005136","url":null,"abstract":"We introduce an extension of Strategy logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to be undecidable. We introduce a syntactical class of “hierarchical instances” for which, intuitively, as one goes down the syntactic tree of the formula, strategy quantifications are concerned with finer observations of the model. We prove that model-checking SLii restricted to hierarchical instances is decidable. This result, because it allows for complex patterns of existential and universal quantification on strategies, greatly generalises previous ones, such as decidability of multi-player games with imperfect information and hierarchical observations, and decidability of distributed synthesis for hierarchical systems. To establish the decidability result, we introduce and study QCTLii*, an extension of QCTL (itself an extension of CTL with second-order quantification over atomic propositions) by parameterising its quantifiers with observations. The simple syntax of QCTLii* allows us to provide a conceptually neat reduction of SLii to QCTLii* that separates concerns, allowing one to forget about strategies and players and focus solely on second-order quantification. While the model-checking problem of QCTLii* is, in general, undecidable, we identify a syntactic fragment of hierarchical formulas and prove, using an automata-theoretic approach, that it is decidable. The decidability result for SLii follows since the reduction maps hierarchical instances of SLii to hierarchical formulas of QCTLii*.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560144","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}

引用次数: 87

Unrestricted stone duality for Markov processes 马尔可夫过程的无限制石对偶性

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-01 DOI: 10.1109/LICS.2017.8005152

Robert Furber, D. Kozen, K. Larsen, R. Mardare, P. Panangaden

引用次数: 8

Computing quantiles in Markov chains with multi-dimensional costs 多维代价马尔可夫链中分位数的计算

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-01 DOI: 10.1109/LICS.2017.8005090

C. Haase, S. Kiefer, Markus Lohrey

{"title":"Computing quantiles in Markov chains with multi-dimensional costs","authors":"C. Haase, S. Kiefer, Markus Lohrey","doi":"10.1109/LICS.2017.8005090","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005090","url":null,"abstract":"Probabilistic systems that accumulate quantities such as energy or cost are naturally modelled by cost chains, which are Markov chains whose transitions are labelled with a vector of numerical costs. Computing information on the probability distribution of the total accumulated cost is a fundamental problem in this model. In this paper, we study the so-called cost problem, which is to compute quantiles of the total cost, such as the median cost or the probability of large costs. While it is an open problem whether such probabilities are always computable or even rational, we present an algorithm that allows to approximate the probabilities with arbitrary precision. The algorithm is simple to state and implement, and exploits strong results from graph theory such as the so-called BEST theorem for efficiently computing the number of Eulerian circuits in a directed graph. Moreover, our algorithm enables us to show that a decision version of the cost problem lies in the counting hierarchy, a counting analogue to the polynomial-time hierarchy that contains the latter and is included in PSPACE. Finally, we demonstrate the applicability of our algorithm by evaluating it experimentally.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122074892","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}

引用次数: 7

Perfect half space games 完美的半空间游戏

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-04-19 DOI: 10.1109/LICS.2017.8005105

Thomas Colcombet, M. Jurdzinski, R. Lazic, S. Schmitz

引用次数: 16