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)最新文献_第2页

Weight monitoring with linear temporal logic: complexity and decidability 线性时间逻辑的权重监测:复杂性和可判定性

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-07-14 DOI: 10.1145/2603088.2603162

C. Baier, Joachim Klein, Sascha Klüppelholz, Sascha Wunderlich

引用次数: 29

No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete 没有带单位的MLL证明网:MLL的证明等价是pspace完全的

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-07-14 DOI: 10.1145/2603088.2603126

W. Heijltjes, Robin Houston

引用次数: 26

Expressive completeness of separation logic with two variables and no separating conjunction 两变量无分离连接分离逻辑的表达完备性

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-07-14 DOI: 10.1145/2603088.2603142

Stephane Demri, Morgan Deters

引用次数: 3

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity 图灵机与原子，约束满足问题，和描述的复杂性

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-07-14 DOI: 10.1145/2603088.2603135

Bartek Klin, S. Lasota, Joanna Ochremiak, Szymon Toruńczyk

引用次数: 14

MSO queries on trees: enumerating answers under updates 树上的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-07-14 DOI: 10.1145/2603088.2603137

Katja Losemann, W. Martens

引用次数: 22

A functional functional interpretation 功能性功能性解释

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-07-14 DOI: 10.1145/2603088.2603094

Pierre-Marie Pédrot

引用次数: 10

Memoryful geometry of interaction: from coalgebraic components to algebraic effects 相互作用的记忆几何:从共代数分量到代数效应

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-07-14 DOI: 10.1145/2603088.2603124

Naohiko Hoshino, Koko Muroya, I. Hasuo

{"title":"Memoryful geometry of interaction: from coalgebraic components to algebraic effects","authors":"Naohiko Hoshino, Koko Muroya, I. Hasuo","doi":"10.1145/2603088.2603124","DOIUrl":"https://doi.org/10.1145/2603088.2603124","url":null,"abstract":"Girard's Geometry of Interaction (GoI) is interaction based semantics of linear logic proofs and, via suitable translations, of functional programs in general. Its mathematical cleanness identifies essential structures in computation; moreover its use as a compilation technique from programs to state machines---\"GoI implementation,\" so to speak---has been worked out by Mackie, Ghica and others. In this paper, we develop Abramsky's idea of resumption based GoI systematically into a generic framework that accounts for computational effects (nondeterminism, probability, exception, global states, interactive I/O, etc.). The framework is categorical: Plotkin & Power's algebraic operations provide an interface to computational effects; the framework is built on the categorical axiomatization of GoI by Abramsky, Haghverdi and Scott; and, by use of the coalgebraic formalization of component calculus, we describe explicit construction of state machines as interpretations of functional programs. The resulting interpretation is shown to be sound with respect to equations between algebraic operations, as well as to Moggi's equations for the computational lambda calculus. We illustrate the construction by concrete examples.","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":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88690503","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}

引用次数: 45

Model checking existential logic on partially ordered sets 部分有序集合上存在逻辑的模型检验

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-07-14 DOI: 10.1145/2603088.2603110

S. Bova, R. Ganian, Stefan Szeider

{"title":"Model checking existential logic on partially ordered sets","authors":"S. Bova, R. Ganian, Stefan Szeider","doi":"10.1145/2603088.2603110","DOIUrl":"https://doi.org/10.1145/2603088.2603110","url":null,"abstract":"We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset). A poset is a reflexive, antisymmetric, and transitive digraph. The problem encompasses the fundamental embedding problem of finding an isomorphic copy of a poset as an induced substructure of another poset. Model checking existential logic is already NP-hard on a fixed poset; thus we investigate structural properties of posets yielding conditions for fixed-parameter tractability when the problem is parameterized by the sentence. We identify width as a central structural property (the width of a poset is the maximum size of a subset of pairwise incomparable elements); our main algorithmic result is that model checking existential logic on classes of finite posets of bounded width is fixed-parameter tractable. We observe a similar phenomenon in classical complexity, where we prove that the isomorphism problem is polynomial-time tractable on classes of posets of bounded width; this settles an open problem in order theory. We surround our main algorithmic result with complexity results on less restricted, natural neighboring classes of finite posets, establishing its tightness in this sense. We also relate our work with (and demonstrate its independence of) fundamental fixed-parameter tractability results for model checking on digraphs of bounded degree and bounded clique-width.","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":"56 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90852091","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}

引用次数: 1

Decidability of weak logics with deterministic transitive closure 具有确定性传递闭包的弱逻辑的可判定性

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-07-14 DOI: 10.1145/2603088.2603134

Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki

{"title":"Decidability of weak logics with deterministic transitive closure","authors":"Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki","doi":"10.1145/2603088.2603134","DOIUrl":"https://doi.org/10.1145/2603088.2603134","url":null,"abstract":"The deterministic transitive closure operator, added to languages containing even only two variables, allows to express many natural properties of a binary relation, including being a linear order, a tree, a forest or a partial function. This makes it a potentially attractive ingredient of computer science formalisms. In this paper we consider the extension of the two-variable fragment of first-order logic by the deterministic transitive closure of a single binary relation, and prove that the satisfiability and finite satisfiability problems for the obtained logic are decidable and ExpSpace-complete. This contrasts with the undecidability of two-variable logic with the deterministic transitive closures of several binary relations, known before. We also consider the class of universal first-order formulas in prenex form. Its various extensions by deterministic closure operations were earlier considered by other authors, leading to both decidability and undecidability results. We examine this scenario in more details.","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":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82340328","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

A new correctness criterion for MLL proof nets 一种新的MLL证明网正确性判据

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-07-14 DOI: 10.1145/2603088.2603125

T. Ehrhard

引用次数: 14