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

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)最新文献

筛选
英文 中文
A Proof of Strong Normalisation using Domain Theory 用域理论证明强归一化
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-3(4:12)2007
T. Coquand, A. Spiwack
{"title":"A Proof of Strong Normalisation using Domain Theory","authors":"T. Coquand, A. Spiwack","doi":"10.2168/LMCS-3(4:12)2007","DOIUrl":"https://doi.org/10.2168/LMCS-3(4:12)2007","url":null,"abstract":"U. Berger, (2005) significantly simplified Tait's normalisation proof for bar recursion, replacing Tait's introduction of infinite terms by the construction of a domain having the property that a term, is strongly normalizing if its semantics is neperp. The goal of this paper is to show that, using ideas from the theory of intersection types and Martin-Lof's domain interpretation of type theory, we can in turn simplify U, Berger's argument in the construction of such a domain model. We think that our domain model can be used to give modular proofs of strong normalization for various type theory. As an example, we show in some details how it can be used to prove strong normalization for Martin-Lof dependent type theory extended with bar recursion, and with some form of proof-irrelevance","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665450","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}
引用次数: 32
A Characterisation of First-Order Constraint Satisfaction Problems 一阶约束满足问题的一个表征
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-3(4:6)2007
B. Larose, C. Loten, Claude Tardif
{"title":"A Characterisation of First-Order Constraint Satisfaction Problems","authors":"B. Larose, C. Loten, Claude Tardif","doi":"10.2168/LMCS-3(4:6)2007","DOIUrl":"https://doi.org/10.2168/LMCS-3(4:6)2007","url":null,"abstract":"We characterise finite relational core structures admitting finitely many obstructions, in terms of special near unanimity functions, and in terms of dismantling properties of their square. As a consequence, we show that it is decidable to determine whether a constraint satisfaction problem is first-order definable: we show the general problem to be NP-complete, and give a polynomial-time algorithm in the case of cores","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122491066","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}
引用次数: 97
Faster Solutions of Rabin and Streett Games 拉宾和街头游戏的快速解决方案
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.23
Nir Piterman, A. Pnueli
{"title":"Faster Solutions of Rabin and Streett Games","authors":"Nir Piterman, A. Pnueli","doi":"10.1109/LICS.2006.23","DOIUrl":"https://doi.org/10.1109/LICS.2006.23","url":null,"abstract":"In this paper we improve the complexity of solving Rabin and Streett games to approximately the square root of previous bounds. We introduce direct Rabin and Streett ranking that are a sound and complete way to characterize the winning sets in the respective games. By computing directly and explicitly the ranking we can solve such games in time O(mnk+1kk!) and space O(nk) for Rabin and O(nkk!) for Streett where n is the number of states, m the number of transitions, and k the number of pairs in the winning condition. In order to prove completeness of the ranking method we give a recursive fixpoint characterization of the winning regions in these games. We then show that by keeping intermediate values during the fixpoint evaluation, we can solve such games symbolically in time O(nk+1k!) and space O(nk+1k!). These results improve on the current bounds of O(mn2kk!) time in the case of direct (symbolic) solution or O(m(nk2k!)k) in the case of reduction to parity games","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129068558","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}
引用次数: 101
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity 强迫性派系:有限时间复杂度的语义表征
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.37
Olivier Laurent, L. Falco
{"title":"Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity","authors":"Olivier Laurent, L. Falco","doi":"10.1109/LICS.2006.37","DOIUrl":"https://doi.org/10.1109/LICS.2006.37","url":null,"abstract":"We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting the morphisms of the category RscrEscrLscr to obsessional cliques yields models of ELL and SLL. Conversely, we prove that these models are relatively complete: an LL proof whose interpretation is an obsessional clique is always an ELL/SLL proof. These results are achieved by introducing a system of ELL/SLL untyped proof-nets, which is both correct and complete with respect to elementary/polynomial time complexity","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124815107","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}
引用次数: 21
Coinductive Proof Principles for Stochastic Processes 随机过程的共归纳证明原理
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-3(4:8)2007
D. Kozen
{"title":"Coinductive Proof Principles for Stochastic Processes","authors":"D. Kozen","doi":"10.2168/LMCS-3(4:8)2007","DOIUrl":"https://doi.org/10.2168/LMCS-3(4:8)2007","url":null,"abstract":"We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic arguments, allowing reasoning about such processes at a higher algebraic level. We illustrate the use of the rule in deriving properties of a simple coin-flip process","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129830608","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}
引用次数: 16
Formal Verification of Infinite State Systems Using Boolean Methods 无限状态系统的布尔方法形式化验证
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1007/11805618_1
R. Bryant
{"title":"Formal Verification of Infinite State Systems Using Boolean Methods","authors":"R. Bryant","doi":"10.1007/11805618_1","DOIUrl":"https://doi.org/10.1007/11805618_1","url":null,"abstract":"","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115977855","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
On Model-Checking Trees Generated by Higher-Order Recursion Schemes 关于高阶递归方案生成的模型检验树
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.38
C. Ong
{"title":"On Model-Checking Trees Generated by Higher-Order Recursion Schemes","authors":"C. Ong","doi":"10.1109/LICS.2006.38","DOIUrl":"https://doi.org/10.1109/LICS.2006.38","url":null,"abstract":"We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and whether homogeneously typed or not) is n-EXPTIME complete, for every nges0. It follows that the monadic second-order theories of these trees are decidable. There are three major ingredients. The first is a certain transference principle from the tree generated by the scheme - the value tree - to an auxiliary computation tree, which is itself a tree generated by a related order-0 recursion scheme (equivalently, a regular tree). Using innocent game semantics in the sense of Hyland and Ong, we establish a strong correspondence between paths in the value tree and traversals in the computation tree. This allows us to prove that a given alternating parity tree automaton (APT) has an (accepting) run-tree over the value tree iff it has an (accepting) traversal-tree over the computation tree. The second ingredient is the simulation of an (accepting) traversal-tree by a certain set of annotated paths over the computation tree; we introduce traversal-simulating APT as a recognising device for the latter. Finally, for the complexity result, we prove that traversal-simulating APT enjoy a succinctness property: for deciding acceptance, it is enough to consider run-trees that have a reduced branching factor. The desired bound is then obtained by analysing the complexity of solving an associated (finite) acceptance parity game","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114939583","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}
引用次数: 287
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives 具有模连接的常深度证明系统的条件下界
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.19
Alexis Maciel, T. Pitassi
{"title":"Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives","authors":"Alexis Maciel, T. Pitassi","doi":"10.1109/LICS.2006.19","DOIUrl":"https://doi.org/10.1109/LICS.2006.19","url":null,"abstract":"It is known that constant-depth Frege proofs of some tautologies require exponential size. No such lower bound result is known for more general proof systems. We consider sequent calculus proofs in which formulas can contain modular connectives and only the cut formulas are restricted to be of constant depth. Under a plausible hardness assumption concerning small-depth Boolean circuits, we prove an exponential lower bound for such proofs. We prove this lower bound directly from the computational hardness assumption. By using the same approach, we obtain the following additional results. We provide a much simpler proof of a known (unconditional) lower bound in the case where only conjunctions and disjunctions are allowed. We establish a conditional exponential separation between the power of constant-depth proofs that use different modular connectives. Finally, under a plausible hardness assumption concerning the polynomial-time hierarchy, we show that the hierarchy Gi* of quantified propositional proof systems does not collapse","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128746334","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
Independence and Concurrent Separation Logic 独立和并发分离逻辑
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-4(1:6)2008
Jonathan Hayman, G. Winskel
{"title":"Independence and Concurrent Separation Logic","authors":"Jonathan Hayman, G. Winskel","doi":"10.2168/LMCS-4(1:6)2008","DOIUrl":"https://doi.org/10.2168/LMCS-4(1:6)2008","url":null,"abstract":"A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the process-environment duality inherent in such rely-guarantee reasoning. Soundness of the rules of concurrent separation logic with respect to this definition of validity is shown. The independence information retained by the Petri net model is then exploited to characterize the independence of parallel processes enforced by the logic. This is shown to permit a refinement operation capable of changing the granularity of atomic actions","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116058884","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
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems 迭代一元链逻辑及其在下推系统中的应用
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.35
D. Kuske, Markus Lohrey
{"title":"Monadic Chain Logic Over Iterations and Applications to Pushdown Systems","authors":"D. Kuske, Markus Lohrey","doi":"10.1109/LICS.2006.35","DOIUrl":"https://doi.org/10.1109/LICS.2006.35","url":null,"abstract":"Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems. It is shown that the monadic chain theory of the iteration of a structure A (in the sense of Shelah and Stupp) is decidable in case the first-order theory of the structure A is decidable. This result fails if Muchnik's clone-predicate is added. A model of pushdown automata, where the stack alphabet is given by an arbitrary (possibly infinite) relational structure, is introduced. If the stack structure has a decidable first-order theory with regular reachability predicates, then the same holds for the configuration graph of this pushdown automaton. This result follows from our decidability result for the monadic chain theory of the iteration","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114538837","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
首页 上一页 下一页 尾页
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学术官方微信
小红书