Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第8页

Coinduction up-to in a fibrational setting 在颤振状态下的共诱导

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-26 DOI: 10.1145/2603088.2603149

F. Bonchi, Daniela Petrisan, D. Pous, J. Rot

引用次数: 53

Subclasses of presburger arithmetic and the weak EXP hierarchy presburger算法的子类和弱EXP层次

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-21 DOI: 10.1145/2603088.2603092

C. Haase

引用次数: 41

Weak MSO: automata and expressiveness modulo bisimilarity 弱MSO:自动机和表达模双相似

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-17 DOI: 10.1145/2603088.2603101

Facundo Carreiro, Alessandro Facchini, Y. Venema, F. Zanasi

引用次数: 11

Infinite sequential games with real-valued payoffs 具有实值收益的无穷连续博弈

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-14 DOI: 10.1145/2603088.2603120

Stéphane Le Roux, A. Pauly

引用次数: 26

Axioms and decidability for type isomorphism in the presence of sums 和存在下类型同构的公理和可判定性

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-11 DOI: 10.1145/2603088.2603115

Danko Ilik

引用次数: 12

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 第23届EACSL计算机科学逻辑年会(CSL)和第29届ACM/IEEE计算机科学逻辑研讨会(LICS)联合会议纪要

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2014-01-01 DOI: 10.1145/2603088

引用次数: 7

Senescent ground tree rewrite systems 衰老的地面树木重写系统

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2013-11-19 DOI: 10.1145/2603088.2603112

M. Hague

引用次数: 8

One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries 一个层次结构衍生出另一个层次结构:图解构和联合查询的复杂性分类

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2013-07-04 DOI: 10.1145/2603088.2603107

Hubie Chen, M. Müller

{"title":"One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries","authors":"Hubie Chen, M. Müller","doi":"10.1145/2603088.2603107","DOIUrl":"https://doi.org/10.1145/2603088.2603107","url":null,"abstract":"We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of structures such that the first structure is an element of A. We present a comprehensive complexity classification of these problems, which strongly links graph-theoretic properties of A to the complexity of the corresponding homomorphism problem. In particular, we define a binary relation on graph classes and completely describe the resulting hierarchy given by this relation. This binary relation is defined in terms of a notion which we call graph deconstruction and which is a variant of the well-known notion of tree decomposition. We then use this hierarchy of graph classes to infer a complexity hierarchy of homomorphism problems which is comprehensive up to a computationally very weak notion of reduction, namely, a parameterized version of quantifier-free reductions. In doing so, we obtain a significantly refined complexity classification of homomorphism problems, as well as a unifying, modular, and conceptually clean treatment of existing complexity classifications. We then present and develop the theory of Ehrenfeucht-Fraïssé-style pebble games which solve the homomorphism problems where the cores of the structures in A have bounded tree depth. Finally, we use our framework to classify the complexity of model checking existential sentences having bounded quantifier rank.","PeriodicalId":20649,"journal":{"name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77756077","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}

引用次数: 15

The complexity of admissibility in Omega-regular games omega -常规游戏的可接受性复杂性

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2013-04-05 DOI: 10.1145/2603088.2603143

Romain Brenguier, Jean-François Raskin, Mathieu Sassolas

引用次数: 28

Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives 鲁棒多维平均收益目标的有限记忆策略综合

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2012-09-05 DOI: 10.1145/2603088.2603096

Yaron Velner

{"title":"Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives","authors":"Yaron Velner","doi":"10.1145/2603088.2603096","DOIUrl":"https://doi.org/10.1145/2603088.2603096","url":null,"abstract":"Two-player games on graphs provide the mathematical foundation for the study of reactive systems. In the quantitative framework, an objective assigns a value to every play, and the goal of player 1 is to minimize the value of the objective. In this framework, there are two relevant synthesis problems to consider: the quantitative analysis problem is to compute the minimal (or infimum) value that player 1 can assure, and the boolean analysis problem asks whether player 1 can assure that the value of the objective is at most ν (for a given threshold ν). Mean-payoff expression games are played on a multidimensional weighted graph. An atomic mean-payoff expression objective is the mean-payoff value (the long-run average weight) of a certain dimension, and the class of mean-payoff expressions is the closure of atomic mean-payoff expressions under the algebraic operations of max, min, numerical complement and sum. In this work, we study for the first time the strategy synthesis problems for games with robust quantitative objectives, namely, games with mean-payoff expression objectives. While in general, optimal strategies for these games require infinite-memory, in synthesis we are typically interested in the construction of a finite-state system. Hence, we consider games in which player 1 is restricted to finite-memory strategies, and our main contribution is as follows. We prove that for mean-payoff expressions, the quantitative analysis problem is computable, and the boolean analysis problem is inter-reducible with Hilbert's tenth problem over rationals --- a fundamental long-standing open problem in computer science and mathematics.","PeriodicalId":20649,"journal":{"name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75295537","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