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

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献

筛选
英文 中文
Towards Completeness via Proof Search in the Linear Time µ-calculus : The case of Büchi inclusions 线性时间微微积分中通过证明搜索的完备性:b<s:1> chi内含的情况
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933598
Amina Doumane, David Baelde, L. Hirschi, A. Saurin
{"title":"Towards Completeness via Proof Search in the Linear Time µ-calculus : The case of Büchi inclusions","authors":"Amina Doumane, David Baelde, L. Hirschi, A. Saurin","doi":"10.1145/2933575.2933598","DOIUrl":"https://doi.org/10.1145/2933575.2933598","url":null,"abstract":"Modal µ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-theoretical side. Nevertheless, axiomatizations have been given for both linear and branching time µ-calculi, with quite involved completeness arguments. We come back to this central problem, considering it from a proof search viewpoint, and provide some new completeness arguments in the linear time µ-calculus. Our results only deal with restricted classes of formulas that closely correspond to (non-alternating) ω-automata but, compared to earlier proofs, our completeness arguments are direct and constructive. We first consider a natural circular proof system based on sequent calculus, and show that it is complete for inclusions of parity automata expressed as formulas, making use of Safra’s construction directly in proof search. We then consider the corresponding finitary proof system, featuring (co)induction rules, and provide a partial translation result from circular to finitary proofs. This yields completeness of the finitary proof system for inclusions of sufficiently deterministic parity automata, and finally for arbitrary Büchi automata.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134129892","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}
引用次数: 13
Conflict nets: Efficient locally canonical MALL proof nets 冲突网:高效的本地规范的MALL证明网
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934559
Dominic J. D. Hughes, W. Heijltjes
{"title":"Conflict nets: Efficient locally canonical MALL proof nets","authors":"Dominic J. D. Hughes, W. Heijltjes","doi":"10.1145/2933575.2934559","DOIUrl":"https://doi.org/10.1145/2933575.2934559","url":null,"abstract":"Proof nets for MLL (unit-free multiplicative linear logic) and ALL (unit-free additive linear logic) are graphical abstractions of proofs which are efficient (proofs translate in linear time) and textitcanonical (invariant under rule commutation). This paper solves a three- decade open problem: are there efficient canonical proof nets for MALL (unit-free multiplicative-additive linear logic)?Honouring MLL and ALL canonicity, in which all commutations are strictly local proof-tree rewrites, we define local canonicity for MLL: invariance under local rule commutation. We present new proof nets for MLL, called conflict nets, which are both efficient and locally canonical.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122247086","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}
引用次数: 13
Semantically Acyclic Conjunctive Queries under Functional Dependencies 功能依赖下的语义非循环合取查询
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933580
Diego Figueira
{"title":"Semantically Acyclic Conjunctive Queries under Functional Dependencies","authors":"Diego Figueira","doi":"10.1145/2933575.2933580","DOIUrl":"https://doi.org/10.1145/2933575.2933580","url":null,"abstract":"The evaluation problem for Conjunctive Queries (CQ) is known to be NP-complete in combined complexity and W[1]-hard in parameterized complexity. However, acyclic CQs and CQs of bounded tree-width can be evaluated in polynomial time in combined complexity and they are fixed-parameter tractable.We study the problem of whether a CQ can be rewritten into an equivalent CQ of bounded tree-width, in the presence of unary functional dependencies, assuming bounded arity signatures. We show that this problem is decidable in doubly exponential time, or in exponential time for a subclass of CQ’s. When it exists, the algorithm also yields a witness query.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122327040","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}
引用次数: 13
Data Communicating Processes with Unreliable Channels 具有不可靠信道的数据通信过程
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934535
P. Abdulla, C. Aiswarya, M. Atig
{"title":"Data Communicating Processes with Unreliable Channels","authors":"P. Abdulla, C. Aiswarya, M. Atig","doi":"10.1145/2933575.2934535","DOIUrl":"https://doi.org/10.1145/2933575.2934535","url":null,"abstract":"We extend the classical model of lossy channel systems by considering systems that operate on a finite set of variables ranging over an infinite data domain. Furthermore, each message inside a channel is equipped with a data item representing its value. Although we restrict the model by allowing the variables to be only tested for (dis-)equality, we show that the state reachability problem is undecidable. In light of this negative result, we consider bounded-phase reachability, where the processes are restricted to performing either send or receive operations during each phase. We show decidability of state reachability in this case by computing a symbolic encoding of the set of system configurations that are reachable from a given configuration.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130359350","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}
引用次数: 3
Program Equivalence is Coinductive 程序等价是共归纳的
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934506
D. Pattinson, Lutz Schröder
{"title":"Program Equivalence is Coinductive","authors":"D. Pattinson, Lutz Schröder","doi":"10.1145/2933575.2934506","DOIUrl":"https://doi.org/10.1145/2933575.2934506","url":null,"abstract":"We describe computational models, notably Turing and counter machines, as state transition systems with side effects. Side effects are expressed via an algebraic signature and interpreted over co-models for that signature: comodels describe the memory model while the transition system captures the control structure. Equational reasoning over comodels is known to be subtle. We identify a criterion on equational theories and classes of comodels that guarantees completeness, over the given class of comodels, of the standard equational calculus, and show that this criterion is satisfied in our leading examples. Based on a complete equational axiomatization of the memory (co)model, we then give a complete inductive-coinductive calculus for simulation between states, where a state simulates another if it has at least the same terminating computations, with the same cumulative effect on global state. Extensional equivalence of computations can then be expressed as mutual simulation. The crucial use of coinduction is to deal with non-termination of the simulated computation where the coinductive rule permits infinite unfolding.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129955773","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}
引用次数: 3
On the Satisfiability of Some Simple Probabilistic Logics 关于一些简单概率逻辑的可满足性
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934526
Souymodip Chakraborty, J. Katoen
{"title":"On the Satisfiability of Some Simple Probabilistic Logics","authors":"Souymodip Chakraborty, J. Katoen","doi":"10.1145/2933575.2934526","DOIUrl":"https://doi.org/10.1145/2933575.2934526","url":null,"abstract":"This paper shows that the satisfiability problems for a bounded fragment of probabilistic CTL (called bounded PCTL) and an extension of the modal μ-calculus with probabilistic quantification over next-modalities (called PμTL) are decidable. For bounded PCTL we provide an NEXP-TIME-algorithm for the satisfiability problem and show that the logic has a small model property where the model size is independent from the probability bounds in the formula. We show that the satisfiability problem of a simple sub-logic of bounded PCTL is PSPACE-complete. We prove that PμTL has a small model property and that a decision procedure using 2 player parity games can be employed for the satisfiability problem of PμTL. These results imply that PμTL and qualitative PCTL formulas with only thresholds >0 and =1—are incomparable. We also establish that—in contrast to PCTL—every satisfiable PμTL-formula has a rational model, a model with rational probabilities only.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121201206","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}
引用次数: 13
A Step Up in Expressiveness of Decidable Fixpoint Logics 可决不动点逻辑在可表达性上的一个进步
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2933592
Michael Benedikt, P. Bourhis, M. V. Boom
{"title":"A Step Up in Expressiveness of Decidable Fixpoint Logics","authors":"Michael Benedikt, P. Bourhis, M. V. Boom","doi":"10.1145/2933575.2933592","DOIUrl":"https://doi.org/10.1145/2933575.2933592","url":null,"abstract":"Guardedness restrictions are one of the principal means to obtain decidable logics — operators such as negation are restricted so that the free variables are contained in an atom. While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited. Here we show that one of the main restrictions imposed in the past can be lifted, getting a richer decidable logic by allowing fixpoints in which the parameters of the fixpoint can be unguarded. Using automata, we show that the resulting logics have a decidable satisfiability problem, and provide a fine study of the complexity of satisfiability. We show that similar methods apply to decide questions concerning the elimination of fixpoints within formulas of the logic.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117091229","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
Hybrid realizability for intuitionistic and classical choice 直觉和经典选择的混合可实现性
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934511
Valentin Blot
{"title":"Hybrid realizability for intuitionistic and classical choice","authors":"Valentin Blot","doi":"10.1145/2933575.2934511","DOIUrl":"https://doi.org/10.1145/2933575.2934511","url":null,"abstract":"In intuitionistic realizability like Kleene’s or Kreisel’s, the axiom of choice is trivially realized. It is even provable in Martin-Löf’s intuitionistic type theory. In classical logic, however, even the weaker axiom of countable choice proves the existence of non-computable functions. This logical strength comes at the price of a complicated computational interpretation which involves strong recursion schemes like bar recursion. We take the best from both worlds and define a realizability model for arithmetic and the axiom of choice which encompasses both intuitionistic and classical reasoning. In this model two versions of the axiom of choice can co-exist in a single proof: intuitionistic choice and classical countable choice. We interpret intuitionistic choice efficiently, however its premise cannot come from classical reasoning. Conversely, our version of classical choice is valid in full classical logic, but it is restricted to the countable case and its realizer involves bar recursion. Having both versions allows us to obtain efficient extracted programs while keeping the provability strength of classical logic.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645061","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}
引用次数: 3
Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing 计算消息的能力在分布式计算中是值得Θ(Δ)轮数的
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934567
Tuomo Lempiäinen
{"title":"Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing","authors":"Tuomo Lempiäinen","doi":"10.1145/2933575.2934567","DOIUrl":"https://doi.org/10.1145/2933575.2934567","url":null,"abstract":"Hella et al. (PODC 2012, Distributed Computing 2015) identified seven different message-passing models of distributed computing— one of which is the port-numbering model—and provided a complete classification of their computational power relative to each other. However, their method for simulating the ability to count incoming messages causes an additive overhead of 2Δ −2 communication rounds, and it was not clear if this is actually optimal. In this paper we give a positive answer, by using bisimulation as our main tool: there is a matching linear-in-Δ lower bound. This closes the final gap in our understanding of the models, with respect to the number of communication rounds. By a previously identified connection to modal logic, our result has implications to the relationship between multimodal logic and graded multimodal logic.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115960375","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
First-order logic with reachability for infinite-state systems 无限状态系统的一阶可达逻辑
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-07-05 DOI: 10.1145/2933575.2934552
Emanuele D’Osualdo, R. Meyer, Georg Zetzsche
{"title":"First-order logic with reachability for infinite-state systems","authors":"Emanuele D’Osualdo, R. Meyer, Georg Zetzsche","doi":"10.1145/2933575.2934552","DOIUrl":"https://doi.org/10.1145/2933575.2934552","url":null,"abstract":"First-order logic with the reachability predicate (FO[R]) is an important means of specification in system analysis. Its decidability status is known for some individual types of infinite-state systems such as pushdown (decidable) and vector addition systems (undecidable).This work aims at a general understanding of which types of systems admit decidability. As a unifying model, we employ valence systems over graph monoids, which feature a finite-state control and are parameterized by a monoid to represent their storage mechanism. As special cases, this includes pushdown systems, various types of counter systems (such as vector addition systems) and combinations thereof. Our main result is a characterization of those graph monoids where FO[R] is decidable for the resulting transition systems.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125702919","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信