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

On the succinctness of query rewriting over shallow ontologies 浅本体上查询重写的简洁性

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.2603131

S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev

引用次数: 13

Logic for communicating automata with parameterized topology 与参数化拓扑通信的自动机逻辑

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.2603093

B. Bollig

引用次数: 4

The tractability frontier of graph-like first-order query 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.2603119

Hubie Chen

引用次数: 11

The geometry of synchronization 同步几何

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.2603154

Ugo Dal Lago, C. Faggian, I. Hasuo, Akira Yoshimizu

引用次数: 17

Anchored LTL separation 锚定LTL分离

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.2603139

Grgur Petric Maretic, M. Dashti, D. Basin

{"title":"Anchored LTL separation","authors":"Grgur Petric Maretic, M. Dashti, D. Basin","doi":"10.1145/2603088.2603139","DOIUrl":"https://doi.org/10.1145/2603088.2603139","url":null,"abstract":"Gabbay's separation theorem is a fundamental result for linear temporal logic (LTL). We show that separating a restricted class of LTL formulas, called anchored LTL, is elementary if and only if the translation from LTL to the linear temporal logic with only future temporal connectives is elementary. To prove this result, we define a canonical separation for LTL, and establish a correspondence between a canonical separation of anchored LTL formulas and the ω-automata that recognize these formulas. The canonical separation of anchored LTL formulas has two further applications. First, we constructively prove that the safety closure of any LTL property is an LTL property, thus proving the decomposition theorem for LTL: every LTL formula is equivalent to the conjunction of a safety LTL formula and a liveness LTL formula. Second, we characterize safety, liveness, absolute liveness, stable, and fairness properties in LTL. Our characterization is effective: We reduce the problem of deciding whether an LTL formula defines any of these properties to the validity problem for LTL.","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":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88361464","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

Equality and fixpoints in the calculus of structures 结构演算中的等式与不动点

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.2603140

Kaustuv Chaudhuri, Nicolas Guenot

引用次数: 1

Hyper-Ackermannian bounds for pushdown vector addition systems 下压向量加法系统的Hyper-Ackermannian界

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.2603146

Jérôme Leroux, M. Praveen, G. Sutre

引用次数: 24

Compositional higher-order model checking via ω-regular games over Böhm trees 通过Böhm树上的ω-正则博弈来检查合成高阶模型

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.2603133

Takeshi Tsukada, C. Ong

{"title":"Compositional higher-order model checking via ω-regular games over Böhm trees","authors":"Takeshi Tsukada, C. Ong","doi":"10.1145/2603088.2603133","DOIUrl":"https://doi.org/10.1145/2603088.2603133","url":null,"abstract":"We introduce type-checking games, which are ω-regular games over Böhm trees, determined by a type of the Kobayashi-Ong intersection type system. These games are a higher-type extension of parity games over trees, determined by an alternating parity tree automaton. However, in contrast to these games over trees, the \"game boards\" of our type-checking games are composable, using the composition of Böhm trees. Moreover the winner (and winning strategies) of a composite game is completely determined by the respective winners (and winning strategies) of the component games. To our knowledge, type-checking games give the first compositional analysis of higher-order model checking, or the model checking of trees generated by recursion schemes. We study a higher-type analogue of higher-order model checking, namely, the problem to decide the winner of a type-checking game over the Böhm tree generated by an arbitrary λY-term. We introduce a new type-assignment system and use it to prove that the problem is decidable. On the semantic side, we develop a novel (two-level) arena game model for type-checking games, which is a cartesian closed category equipped with parametric monad and comonad that themselves form a parametrised adjunction.","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":"44 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90475240","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}

引用次数: 29

On the pigeonhole and related principles in deep inference and monotone 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 : 2014-07-14 DOI: 10.1145/2603088.2603164

Anupam Das

{"title":"On the pigeonhole and related principles in deep inference and monotone systems","authors":"Anupam Das","doi":"10.1145/2603088.2603164","DOIUrl":"https://doi.org/10.1145/2603088.2603164","url":null,"abstract":"We construct quasipolynomial-size proofs of the propositional pigeonhole principle in the deep inference system KS, addressing an open problem raised in previous works and matching the best known upper bound for the more general class of monotone proofs. We make significant use of monotone formulae computing boolean threshold functions, an idea previously considered in works of Atserias et al. The main construction, monotone proofs witnessing the symmetry of such functions, involves an implementation of merge-sort in the design of proofs in order to tame the structural behaviour of atoms, and so the complexity of normalization. Proof transformations from previous work on atomic flows are then employed to yield appropriate KS proofs. As further results we show that our constructions can be applied to provide quasipolynomial-size KS proofs of the parity principle and the generalized pigeonhole principle. These bounds are inherited for the class of monotone proofs, and we are further able to construct nO(log log n)-size monotone proofs of the weak pigeonhole principle with (1 + ε)n pigeons and n holes for ε = 1/logk n, thereby also improving the best known bounds for monotone proofs.","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":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76050210","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

Deadlock and lock freedom in the linear π-calculus 线性π微积分中的死锁与锁自由度

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.2603116

L. Padovani

引用次数: 78