发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Definability of semidefinite programming and lasserre lower bounds for CSPs csp的半定规划的可定义性和lasserre下界
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005108
A. Dawar, Pengming Wang
{"title":"Definability of semidefinite programming and lasserre lower bounds for CSPs","authors":"A. Dawar, Pengming Wang","doi":"10.1109/LICS.2017.8005108","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005108","url":null,"abstract":"We show that the ellipsoid method for solving semidefinite programs (SDPs) can be expressed in fixed-point logic with counting (FPC). This generalizes an earlier result that the optimal value of a linear program can be expressed in this logic.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122156515","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
Descriptive Complexity for counting complexity classes 描述复杂度用于计算复杂度类
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.23638/LMCS-16(1:9)2020
M. Arenas, Martin Muñoz, Cristian Riveros
{"title":"Descriptive Complexity for counting complexity classes","authors":"M. Arenas, Martin Muñoz, Cristian Riveros","doi":"10.23638/LMCS-16(1:9)2020","DOIUrl":"https://doi.org/10.23638/LMCS-16(1:9)2020","url":null,"abstract":"Descriptive Complexity has been very successful in characterizing complexity classes of decision problems in terms of the properties definable in some logics. However, descriptive complexity for counting complexity classes, such as FP and #P, has not been systematically studied, and it is not as developed as its decision counterpart. In this paper, we propose a framework based on Weighted Logics to address this issue. Specifically, by focusing on the natural numbers we obtain a logic called Quantitative Second Order Logics (QSO), and show how some of its fragments can be used to capture fundamental counting complexity classes such as FP, #P and FPSPACE, among others. We also use QSO to define a hierarchy inside #P, identifying counting complexity classes with good closure and approximation properties, and which admit natural complete problems. Finally, we add recursion to QSO, and show how this extension naturally captures lower counting complexity classes such as #L.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804451","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}
引用次数: 19
Cut-free completeness for modal mu-calculus 模态微积分的无切完备性
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005088
B. Afshari, Graham Emil Leigh
{"title":"Cut-free completeness for modal mu-calculus","authors":"B. Afshari, Graham Emil Leigh","doi":"10.1109/LICS.2017.8005088","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005088","url":null,"abstract":"We present two finitary cut-free sequent calculi for the modal μ-calculus. One is a variant of Kozen's axiomatisation in which cut is replaced by a strengthening of the induction rule for greatest fixed point. The second calculus derives annotated sequents in the style of Stirling's ‘tableau proof system with names’ (2014) and features a generalisation of the ν-regeneration rule that allows discharging open assumptions. Soundness and completeness for the two calculi is proved by establishing a sequence of embeddings between proof systems, starting at Stirling's tableau-proofs and ending at the original axiomatisation of the μ-calculus due to Kozen. As a corollary we obtain a new, constructive, proof of completeness for Kozen's axiomatisation which avoids the usual detour through automata and games.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115391926","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}
引用次数: 50
Verification of randomized security protocols 随机安全协议的验证
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005126
Rohit Chadha, A. Sistla, Mahesh Viswanathan
{"title":"Verification of randomized security protocols","authors":"Rohit Chadha, A. Sistla, Mahesh Viswanathan","doi":"10.1109/LICS.2017.8005126","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005126","url":null,"abstract":"We consider the problem of verifying the security of finitely many sessions of a protocol that tosses coins in addition to standard cryptographic primitives against a Dolev-Yao adversary. Two properties are investigated here — secrecy, which asks if no adversary interacting with a protocol P can determine a secret sec with probability > 1 − p; and indistinguishability, which asks if the probability observing any sequence 0̄ in P1 is the same as that of observing 0̄ in P2, under the same adversary. Both secrecy and indistinguishability are known to be coNP-complete for non-randomized protocols. In contrast, we show that, for randomized protocols, secrecy and indistinguishability are both decidable in coNEXPTIME. We also prove a matching lower bound for the secrecy problem by reducing the non-satisfiability problem of monadic first order logic without equality.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"711 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116970217","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}
引用次数: 12
The primitivity of operators in the algebra of binary relations under conjunctions of containments 包含合的二元关系代数中算子的原性
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005122
D. Surinx, J. V. D. Bussche, D. V. Gucht
{"title":"The primitivity of operators in the algebra of binary relations under conjunctions of containments","authors":"D. Surinx, J. V. D. Bussche, D. V. Gucht","doi":"10.1109/LICS.2017.8005122","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005122","url":null,"abstract":"The algebra of binary relations provides union and composition as basic operators, with the empty set as neutral element for union and the identity relation as neutral element for composition. The basic algebra can be enriched with additional features. We consider the diversity relation, the full relation, intersection, set difference, projection, coprojection, converse, and transitive closure. It is customary to express boolean queries on binary relational structures as finite conjunctions of containments. We investigate which features are primitive in this setting, in the sense that omitting the feature would allow strictly less boolean queries to be expressible. Our main result is that, modulo a finite list of elementary interdependencies among the features, every feature is indeed primitive.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128181906","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
Timed pushdown automata and branching vector addition systems 定时下推自动机和分支向量加法系统
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005083
Lorenzo Clemente, S. Lasota, R. Lazic, Filip Mazowiecki
{"title":"Timed pushdown automata and branching vector addition systems","authors":"Lorenzo Clemente, S. Lasota, R. Lazic, Filip Mazowiecki","doi":"10.1109/LICS.2017.8005083","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005083","url":null,"abstract":"We prove that non-emptiness of timed register pushdown automata is decidable in doubly exponential time. This is a very expressive class of automata, whose transitions may involve state and top-of-stack clocks with unbounded differences. It strictly subsumes pushdown timed automata of Bouajjani et al., dense-timed pushdown automata of Abdulla et al., and orbit-finite timed register pushdown automata of Clemente and Lasota. Along the way, we prove two further decidability results of independent interest: for non-emptiness of least solutions to systems of equations over sets of integers with addition, union and intersections with ℕ and −ℕ, and for reachability in one-dimensional branching vector addition systems with states and subtraction, both in exponential time.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132882448","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}
引用次数: 9
On the axiomatizability of quantitative algebras 关于定量代数的公理化性
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005102
R. Mardare, P. Panangaden, G. Plotkin
{"title":"On the axiomatizability of quantitative algebras","authors":"R. Mardare, P. Panangaden, G. Plotkin","doi":"10.1109/LICS.2017.8005102","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005102","url":null,"abstract":"Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by us in 2016. They provide the mathematical foundation for metric semantics of probabilistic, stochastic and other quantitative systems. This paper considers the issue of axiomatizability of QAs. We investigate the entire spectrum of types of quantitative equations that can be used to axiomatize theories: (i) simple quantitative equations; (ii) Horn clauses with no more than c equations between variables as hypotheses, where c is a cardinal and (iii) the most general case of Horn clauses. In each case we characterize the class of QAs and prove variety/quasivariety theorems that extend and generalize classical results from model theory for algebras and first-order structures.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133869903","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}
引用次数: 35
The continuity of monadic stream functions 一元流函数的连续性
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005119
Venanzio Capretta, Jonathan Fowler
{"title":"The continuity of monadic stream functions","authors":"Venanzio Capretta, Jonathan Fowler","doi":"10.1109/LICS.2017.8005119","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005119","url":null,"abstract":"Brouwer's continuity principle states that all functions from infinite sequences of naturals to naturals are continuous, that is, for every sequence the result depends only on a finite initial segment. It is an intuitionistic axiom that is incompatible with classical mathematics. Recently Martín Escardó proved that it is also inconsistent in type theory.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124690304","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}
引用次数: 4
Descriptive complexity of linear equation systems and applications to propositional proof complexity 线性方程组的描述复杂性及其在命题证明复杂性中的应用
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1109/LICS.2017.8005081
Martin Grohe, Wied Pakusa
{"title":"Descriptive complexity of linear equation systems and applications to propositional proof complexity","authors":"Martin Grohe, Wied Pakusa","doi":"10.1109/LICS.2017.8005081","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005081","url":null,"abstract":"We prove that the solvability of systems of linear equations and related linear algebraic properties are definable in a fragment of fixed-point logic with counting that only allows polylogarithmically many iterations of the fixed-point operators. This enables us to separate the descriptive complexity of solving linear equations from full fixed-point logic with counting by logical means. As an application of these results, we separate an extension of first-order logic with a rank operator from fixed-point logic with counting, solving an open problem due to Holm [21]. We then draw a connection from this work in descriptive complexity theory to graph isomorphism testing and propositional proof complexity. Answering an open question from [7], we separate the strength of certain algebraic graph-isomorphism tests. This result can also be phrased as a separation of the algebraic propositional proof systems “Nullstellensatz” and “monomial PC”.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598907","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}
引用次数: 11
The complexity of minimal inference problem for conservative constraint languages 保守约束语言最小推理问题的复杂性
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI: 10.1145/3301410
Michał Wrona
{"title":"The complexity of minimal inference problem for conservative constraint languages","authors":"Michał Wrona","doi":"10.1145/3301410","DOIUrl":"https://doi.org/10.1145/3301410","url":null,"abstract":"We study the complexity of the inference problem for propositional circumscription (the minimal inference problem) over arbitrary finite domains. The problem is of fundamental importance in nonmonotonic logics and commonsense reasoning. The complexity of the problem for the two-element domain has been completely classified [Durand, Hermann, and Nordh, Trichotomy in the complexity of minimal inference, LICS 2009]. In this paper, we classify the complexity of the problem over all conservative languages. We consider a version of the problem parameterized by a set of relations (a constraint language), from which we are allowed to build a knowledge base, and where a linear order used to compare models is a part of an input. We show that in this setting the problem is either Π2P-complete, coNP-complete, or in P. The classification is based on a coNP-hardness proof for a new class of languages, an analysis of languages that do not express any member of the class and a new general polynomial-time algorithm solving the minimal inference problem for a large class of languages.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129413248","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信