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

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)最新文献

筛选
英文 中文
Locally Excluding a Minor 本地排除未成年人
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.31
A. Dawar, Martin Grohe, S. Kreutzer
{"title":"Locally Excluding a Minor","authors":"A. Dawar, Martin Grohe, S. Kreutzer","doi":"10.1109/LICS.2007.31","DOIUrl":"https://doi.org/10.1109/LICS.2007.31","url":null,"abstract":"We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph classes with bounded local tree-width. We show that first-order model-checking is fixed-parameter tractable on any class of graphs locally excluding a minor. This strictly generalises analogous results by Flum and Grohe on excluded minor classes and Frick and Grohe on classes with bounded local tree-width. As an important consequence of the proof we obtain fixed-parameter algorithms for problems such as dominating or independent set on graph classes excluding a minor, where now the parameter is the size of the dominating set and the excluded minor. We also study graph classes with excluded minors, where the minor may grow slowly with the size of the graphs and show that again, first-order model-checking is fixed-parameter tractable on any such class of graphs.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121145259","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}
引用次数: 123
Quantified Equality Constraints 量化等式约束
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1137/080725209
M. Bodirsky, Hubie Chen
{"title":"Quantified Equality Constraints","authors":"M. Bodirsky, Hubie Chen","doi":"10.1137/080725209","DOIUrl":"https://doi.org/10.1137/080725209","url":null,"abstract":"An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128245638","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}
引用次数: 33
Full abstraction for nominal general references 名义上的一般参考的完全抽象
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.2168/LMCS-5(3:8)2009
N. Tzevelekos
{"title":"Full abstraction for nominal general references","authors":"N. Tzevelekos","doi":"10.2168/LMCS-5(3:8)2009","DOIUrl":"https://doi.org/10.2168/LMCS-5(3:8)2009","url":null,"abstract":"Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names. These are ordinary games cast in the theory of nominal sets developed by Pitts and Gabbay. Here we take nominal games one step further, by developing a fully abstract semantics for a language with nominal general references.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124385697","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}
引用次数: 43
A Robust Class of Context-Sensitive Languages 一类鲁棒的上下文敏感语言
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.9
S. L. Torre, P. Madhusudan, G. Parlato
{"title":"A Robust Class of Context-Sensitive Languages","authors":"S. L. Torre, P. Madhusudan, G. Parlato","doi":"10.1109/LICS.2007.9","DOIUrl":"https://doi.org/10.1109/LICS.2007.9","url":null,"abstract":"We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines the operation on the stacks, and (b) any computation of the machine can be split into k stages, where in each stage, there is at most one stack that is popped. MVPLs are an extension of visibly pushdown languages that captures noncontext free behaviors, and has applications in analyzing abstractions of multithreaded recursive programs, signifi- cantly enlarging the search space that can be explored for them. We show that MVPLs are closed under boolean operations, and problems such as emptiness and inclusion are decidable. We characterize MVPLs using monadic second-order logic over appropriate structures, and exhibit a Parikh theorem for them.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379612","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}
引用次数: 129
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications 计算和应用正确性的高效保密证明
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.24
M. Rabin, R. Servedio, C. Thorpe
{"title":"Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications","authors":"M. Rabin, R. Servedio, C. Thorpe","doi":"10.1109/LICS.2007.24","DOIUrl":"https://doi.org/10.1109/LICS.2007.24","url":null,"abstract":"We present a highly efficient method for proving correctness of computations while preserving secrecy of the input values. This is done in an Evaluator-Prover model which can also be realized by a secure processor. We describe an application to secure auctions.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131417342","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}
引用次数: 24
Higher-Order Matching, Games and Automata 高阶匹配，游戏和自动机
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.23
C. Stirling
{"title":"Higher-Order Matching, Games and Automata","authors":"C. Stirling","doi":"10.1109/LICS.2007.23","DOIUrl":"https://doi.org/10.1109/LICS.2007.23","url":null,"abstract":"Higher-order matching is the problem given t = u where t, u are terms of simply typed lambda-calculus and u is closed, is there a substitution thetas such that tthetas and u have the same normal form with respect to betaeta-equality: can t be pattern matched to u? This paper considers the question: can we characterize the set of all solution terms to a matching problem? We provide an automata-theoretic account that is relative to resource: given a matching problem and a finite set of variables and constants, the (possibly infinite) set of terms that are built from those components and that solve the problem is regular. The characterization uses standard bottom-up tree automata.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132944513","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
Modified Realizability Interpretation of Classical Linear Logic 经典线性逻辑的可实现性修正解释
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.32
Paulo Oliva
{"title":"Modified Realizability Interpretation of Classical Linear Logic","authors":"Paulo Oliva","doi":"10.1109/LICS.2007.32","DOIUrl":"https://doi.org/10.1109/LICS.2007.32","url":null,"abstract":"This paper presents a modified realizability interpretation of classical linear logic. The interpretation is based on work of de Paiva (1989), Blass (1995), and Shirahata (2006) on categorical models of classical linear logic using Godel's Dialectica interpretation. Whereas the Dialectica categories provide models of linear logic, our interpretation is presented as an endo-interpretation of proofs, which does not leave the realm of classical linear logic. The advantage is that we obtain stronger versions of the disjunction and existence properties, and new conservation results for certain choice principles. Of particular interest is the simple branching quantifier used in order to obtain a completeness result for the modified realizability interpretation.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128802342","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}
引用次数: 15
Tractability and learnability arising from algebras with few subpowers 少次幂代数的可跟踪性和可学习性
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1137/090775646
P. Idziak, P. Marković, R. McKenzie, M. Valeriote, R. Willard
{"title":"Tractability and learnability arising from algebras with few subpowers","authors":"P. Idziak, P. Marković, R. McKenzie, M. Valeriote, R. Willard","doi":"10.1137/090775646","DOIUrl":"https://doi.org/10.1137/090775646","url":null,"abstract":"A k-edge operation phi on a finite set A is a k + 1-ary operation that satisfies the identities phi (x,x,y,...,y) ap phi(x,y,x,y,...,y) ap y, phi(y,y,y,x,y,...,y) ap phi(y,y,y,y,x,y,...,y) ap ... ap ... phi(y,y,y,...,y,x) ap y. We prove that any constraint language .. that, for some k > 1, has a k-edge operation as a polymorphism is globally tractable. We also show that the set of relations definable over Gamma using quantified generalized formulas is polynomially exactly learnable using improper equivalence queries. Special instances of k-edge operations are Mal'cev and near-unanimity operations and so this class of constraint languages includes many well known examples.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126351394","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}
引用次数: 177
Stratified Bounded Affine Logic for Logarithmic Space 对数空间的分层有界仿射逻辑
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.45
Ulrich Schöpp
{"title":"Stratified Bounded Affine Logic for Logarithmic Space","authors":"Ulrich Schöpp","doi":"10.1109/LICS.2007.45","DOIUrl":"https://doi.org/10.1109/LICS.2007.45","url":null,"abstract":"A number of complexity classes, most notably PTIME, have been characterised by sub-systems of linear logic. In this paper we show that the functions computable in logarithmic space can also be characterised by a restricted version of linear logic. We introduce stratified bounded affine logic (SBAL), a restricted version of bounded linear logic, in which not only the modality, but also the universal quantifier is bounded by a resource polynomial. We show that the proofs of certain sequents in SBAL represent exactly the functions computable logarithmic space. The proof that SBAL-proofs can be compiled to LOGSPACE functions rests on modelling computation by interaction dialogues in the style of game semantics. We formulate the compilation of SBAL-proofs to space-efficient programs as an interpretation in a realisability model, in which realisers are taken from a geometry of interaction situation.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113939206","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}
引用次数: 46
A Dependent Set Theory 相依集合论
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI: 10.1109/LICS.2007.7
Wojciech Moczydlowski
{"title":"A Dependent Set Theory","authors":"Wojciech Moczydlowski","doi":"10.1109/LICS.2007.7","DOIUrl":"https://doi.org/10.1109/LICS.2007.7","url":null,"abstract":"Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we introduce a dependent impredicative constructive set theory which we call IZFD. Using realizability, we prove that the underlying lambda calculus weakly normalizes, thus enabling program extraction from IZF_D proofs. We also show that IZFD can interpret IZF with Collection. By a wellknown result of Friedman, this establishes IZFD as a remarkably strong theory, with proof-theoretical power equal to that of ZFC. We further demonstrate that IZFD provides a natural framework to interpret first-order definitions, thus removing a longstanding barrier to implementing constructive set theories. Finally, we prove that IZFD extended with excluded middle is consistent, thus paving the way to using our framework in the classical setting as well.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122857026","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
下一页 尾页
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学术官方微信