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

On the characterization of models of H 关于H模型的表征

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

Flavien Breuvart

引用次数: 2

Symmetric normalisation for intuitionistic logic 直觉逻辑的对称归一化

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

Nicolas Guenot, Lutz Straßburger

引用次数: 7

Pattern logics and auxiliary relations 模式逻辑和辅助关系

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

Diego Figueira, L. Libkin

{"title":"Pattern logics and auxiliary relations","authors":"Diego Figueira, L. Libkin","doi":"10.1145/2603088.2603136","DOIUrl":"https://doi.org/10.1145/2603088.2603136","url":null,"abstract":"A common theme in the study of logics over finite structures is adding auxiliary predicates to enhance expressiveness and convey additional information. Examples include adding an order or arithmetic for capturing complexity classes, or the power of real-life declarative languages. A recent trend is to add a data-value comparison relation to words, trees, and graphs, for capturing modern data models such as XML and graph databases. Such additions often result in the loss of good properties of the underlying logic. Our goal is to show that such a loss can be avoided if we use pattern-based logics, standard in XML and graph data querying. The essence of such logics is that auxiliary relations are tested locally with respect to other relations in the structure. These logics are shown to admit strong versions of Hanf and Gaifman locality theorems, which are used to prove a homomorphism preservation theorem, and a decidability result for the satisfiability problem. We discuss applications of these results to pattern logics over data forests, and consequently to querying XML data.","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":"300 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79688264","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}

引用次数: 5

Asymptotic behaviour in temporal logic 时间逻辑中的渐近行为

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

E. Asarin, Michel Blockelet, Aldric Degorre, C. Dima, C. Mu

引用次数: 5

A domain-theoretic approach to Brownian motion and general continuous stochastic processes 布朗运动和一般连续随机过程的域理论方法

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

Paul Bilokon, A. Edalat

引用次数: 6

Symmetry in concurrent games 并发游戏中的对称性

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

Simon Castellan, P. Clairambault, G. Winskel

引用次数: 34

Faster decision of first-order graph properties 更快地决定一阶图的属性

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

Ryan Williams

引用次数: 25

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

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

A quest for algorithmically random infinite 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.2603114

B. Khoussainov

{"title":"A quest for algorithmically random infinite structures","authors":"B. Khoussainov","doi":"10.1145/2603088.2603114","DOIUrl":"https://doi.org/10.1145/2603088.2603114","url":null,"abstract":"The last two decades have witnessed significant advances in the investigation of algorithmic randomness, such as Martin-Löf randomness, of infinite strings. In spite of much work, research on randomness of infinite strings has excluded the investigation of algorithmic randomness for infinite algebraic structures. The main obstacle in introducing algorithmic randomness for infinite structures is that many classes of infinite structures lack measure. More precisely, it is unclear how one would define a meaningful measure through which it would be possible to introduce algorithmic randomness for infinite structures. In this paper, we overcome this obstacle by proposing a limited amount of finiteness conditions on various classes of infinite structures. These conditions will enable us to introduce measure and, as a consequence, reason about algorithmic randomness. Our classes include finitely generated universal algebras, connected graphs and tress of bounded degree, and monoids. For all these classes one can introduce algorithmic randomness concepts and prove existence of random structures. In particular, we prove that Martin-Lóf random universal algebras, graphs, trees, and monoids exist. In the case of trees we show a stronger result that Martin-Löf random computably enumerable trees exist.","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":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87090370","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}

引用次数: 14