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

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022 第37届ACM/IEEE计算机科学逻辑研讨会，海法，以色列，2022年8月2 - 5日
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2022-01-01 DOI: 10.1145/3531130
{"title":"LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022","authors":"","doi":"10.1145/3531130","DOIUrl":"https://doi.org/10.1145/3531130","url":null,"abstract":"","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85222613","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
Local normal forms and their use in algorithmic meta theorems (Invited Talk) 局部范式及其在算法元定理中的应用(特邀演讲)
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2019-06-24 DOI: 10.1109/LICS.2019.8785748
Nicole Schweikardt
{"title":"Local normal forms and their use in algorithmic meta theorems (Invited Talk)","authors":"Nicole Schweikardt","doi":"10.1109/LICS.2019.8785748","DOIUrl":"https://doi.org/10.1109/LICS.2019.8785748","url":null,"abstract":"This invited talk provides a personal perspective of recent developments concerning local normal forms and their use in algorithmic meta theorems.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"7 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81809929","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}
引用次数: 1
A short story of the CSP dichotomy conjecture 一个关于CSP二分法猜想的小故事
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2019-06-24 DOI: 10.1109/LICS.2019.8785678
A. Bulatov
{"title":"A short story of the CSP dichotomy conjecture","authors":"A. Bulatov","doi":"10.1109/LICS.2019.8785678","DOIUrl":"https://doi.org/10.1109/LICS.2019.8785678","url":null,"abstract":"It has been observed long time ago that ‘natural’ computational problems tend to be complete in ‘natural’ complexity classes such as NL, P, NP, or PSPACE. Although Ladner in 1975 proved that if $mathrm{P}neq mathrm{NP}$ then there are infinitely many complexity classes between them, all the examples of such intermediate problems are based on diagonalization constructions and are very artificial. Since the seminal work by Feder and Vardi [8] this phenomenon is known as complexity dichotomy (for P and NP), see also Valiant's work [14] in the context of counting problems. Concerted efforts have been made to make this observation more precise, and since the concept of a ‘natural’ problem is somewhat ambiguous, a possible research direction is to pursue dichotomy results for wide classes of problems. The Constraint Satisfaction problem (CSP) is one of such classes.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"90 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90663687","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
LICS 2017 foreword LICS 2017前言
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2017-06-01 DOI: 10.1109/LICS.2017.8005058
J. Ouaknine
{"title":"LICS 2017 foreword","authors":"J. Ouaknine","doi":"10.1109/LICS.2017.8005058","DOIUrl":"https://doi.org/10.1109/LICS.2017.8005058","url":null,"abstract":"This volume contains the proceedings of the 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), held at Reykjavik University in Iceland from 20 to 23 June 2017. LICS is an annual international forum on the broad range of topics that lie at the intersection of computer science and mathematical logic. In addition to the main symposium, seven workshops were co-located with LICS 2017: • INFINITY: Verification of Infinite-State Systems • LearnAut: Learning and Automata • LCC: Logic and Computational Complexit • LMW: Logic Mentoring Workshop • LOLA: Syntax and Semantics of Low-Level Languages • Metafinite model theory and definability and complexity of numeric graph parameters • WiL: Women in Logic","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"30 1","pages":"ii-iv"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73828473","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
Backward Induction in Games of Perfect Information 完全信息博弈中的逆向归纳法
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.8
R. Aumann
{"title":"Backward Induction in Games of Perfect Information","authors":"R. Aumann","doi":"10.1109/LICS.2012.8","DOIUrl":"https://doi.org/10.1109/LICS.2012.8","url":null,"abstract":"Summary form only given. One of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of Games of Perfect Information (like Chess or Checkers). Of central interest in this connectioOne of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of Games of Perfect Information (like Chess or Checkers). Of central interest in this connection is the Backward Induction algorithm, which has generated a good deal of controversy, and with it, a large literature. We will review some of this literature, culminating with an as yet unpublished result of Itai Arieli and the speaker.n is the Backward Induction algorithm, which has generated a good deal of controversy, and with it, a large literature. We will review some of this literature, culminating with an as yet unpublished result of Itai Arieli and the speaker.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"125 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80205355","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
Deciding Definability in FO2(<) (or XPath) on Trees 决定树的FO2(<)(或XPath)中的可定义性
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2010-07-11 DOI: 10.1109/LICS.2010.17
Thomas Place, L. Segoufin
{"title":"Deciding Definability in FO2(<) (or XPath) on Trees","authors":"Thomas Place, L. Segoufin","doi":"10.1109/LICS.2010.17","DOIUrl":"https://doi.org/10.1109/LICS.2010.17","url":null,"abstract":"We prove that it is decidable whether a regular unranked tree language is definable in FO2(<h,<;v). By FO2(<h,<v) we refer to the two variable fragment of first order logic built from the descendant and following sibling predicates. In terms of expressive power it corresponds to a fragment of the navigational core of XPath that contains modalities for going up to some ancestor, down to some descendant, left to some preceding sibling, and right to some following sibling. We also investigate definability in some other fragments of XPath.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"48 5 1","pages":"253-262"},"PeriodicalIF":0.0,"publicationDate":"2010-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90730119","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
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules 命令式高阶框架规则的观察完全程序逻辑
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2005-01-01 DOI: 10.1109/LICS.2005.5
Kohei Honda, N. Yoshida, Martin Berger
{"title":"An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules","authors":"Kohei Honda, N. Yoshida, Martin Berger","doi":"10.1109/LICS.2005.5","DOIUrl":"https://doi.org/10.1109/LICS.2005.5","url":null,"abstract":"","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"88 1","pages":"270-279"},"PeriodicalIF":0.0,"publicationDate":"2005-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91063834","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
VTC circ: A Second-Order Theory for TCcirc VTC circ: tcirc的二阶理论
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-07-13 DOI: 10.1109/LICS.2004.1319632
Phuong Nguyen, S. Cook
{"title":"VTC circ: A Second-Order Theory for TCcirc","authors":"Phuong Nguyen, S. Cook","doi":"10.1109/LICS.2004.1319632","DOIUrl":"https://doi.org/10.1109/LICS.2004.1319632","url":null,"abstract":"We introduce a finitely axiomatizable second-order theory, which is VTC/sup 0/ associated with the class FO-uniform TC/sup 0/. It consists of the base theory V/sup 0/ for AC/sup 0/ reasoning together with the axiom NUMONES, which states the existence of a \"counting array\" Y for any string X: the ith row of Y contains only the number of 1 bits up to (excluding) bit i of X. We introduce the notion of \"strong /spl Delta//sub 1//sup B/-definability\" for relations in a theory, and use a recursive characterization of the TC/sup 0/ relations (rather than functions) to show that the TC/sup 0/ relations are strongly /spl Delta//sub 1//sup B/-definable. It follows that the TC/sup 0/ functions are /spl Sigma//sub 1//sup B/-definable in VTC/sup 0/. We prove a general witnessing theorem for second-order theories and conclude that the/spl Sigma//sub 1//sup B/ theorems of VTC/sup 0/ are witnessed by TC/sup 0/ functions. We prove that VTC/sup 0/ is RSUV isomorphic to the first order theory /spl Delta//sub 1//sup b/-CR of Johannsen and Pollett (the \"minimal theory for TC/sup 0/\"), /spl Delta//sub 1//sup b/-CR includes the /spl Delta//sub 1//sup b/ comprehension rule, and J and P ask whether there is an upper bound to the nesting depth required for this rule. We answer \"yes\", because VTC/sup 0/ , and therefore /spl Delta//sub 1//sup b/-CR, are finitely axiomatizable. Finally, we show that /spl Sigma//sub 1//sup B/ theorems of VTC/sup 0/ translate to families of tautologies which have polynomial-size constant-depth TC/sup 0/-Frege proofs. We also show that PHP is a /spl Sigma//sub 0//sup B/ theorem of VTC/sup 0/. These together imply that the family of propositional tautologies associated with PHP has polynomial-size constant-depth TC/sup 0/-Frege proofs.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"4 1","pages":"378-387"},"PeriodicalIF":0.0,"publicationDate":"2004-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88711628","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}
引用次数: 1
The Omega Rule is II_2^0-Hard in the lambda beta -Calculus 规则是II_2^0-微积分中很难
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-07-13 DOI: 10.1109/LICS.2004.1319614
B. Intrigila, R. Statman
{"title":"The Omega Rule is II_2^0-Hard in the lambda beta -Calculus","authors":"B. Intrigila, R. Statman","doi":"10.1109/LICS.2004.1319614","DOIUrl":"https://doi.org/10.1109/LICS.2004.1319614","url":null,"abstract":"We give a many-one reduction of the set of true /spl Pi//sub 2//sup 0/ sentences to the set of consequences of the lambda calculus with the omega rule. This solves in the affirmative a well known problem of H. Barendregt. The technique of proof has interest in itself and can be extended to prove that the theory which identifies all unsolvable terms together with the omega rule is H/sub 1//sup 1/-complete which solves another long-standing conjecture of H. Barendregt.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"17 1","pages":"202-210"},"PeriodicalIF":0.0,"publicationDate":"2004-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90533804","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}
引用次数: 1
A Landscape with Games in the Backgroun 以游戏为背景的风景
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 2004-01-01 DOI: 10.1109/LICS.2004.1319630
I. Walukiewicz
{"title":"A Landscape with Games in the Backgroun","authors":"I. Walukiewicz","doi":"10.1109/LICS.2004.1319630","DOIUrl":"https://doi.org/10.1109/LICS.2004.1319630","url":null,"abstract":"","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"51 1","pages":"356-366"},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86671771","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
下一页 尾页
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学术官方微信