Pub Date : 2019-06-24DOI: 10.1109/LICS.2019.8785748
Nicole Schweikardt
This invited talk provides a personal perspective of recent developments concerning local normal forms and their use in algorithmic meta theorems.
本次特邀演讲提供了关于局部范式及其在算法元定理中的应用的最新发展的个人观点。
{"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}
Pub Date : 2019-06-24DOI: 10.1109/LICS.2019.8785678
A. Bulatov
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.
{"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}
Pub Date : 2017-06-01DOI: 10.1109/LICS.2017.8005058
J. Ouaknine
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
{"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}
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.
{"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}
We study on which classes of graphs first-order logic (FO) and monadic second-order logic (MSO) have the same expressive power. We show that for each class of graphs that is closed under taking subgraphs, FO and MSO have the same expressive power on the class if, and only if, it has bounded tree depth. Tree depth is a graph invariant that measures the similarity of a graph to a star in a similar way that tree width measures the similarity of a graph to a tree. For classes just closed under taking induced subgraphs, we show an analogous result for guarded second-order logic (GSO), the variant of MSO that not only allows quantification over vertex sets but also over edge sets. A key tool in our proof is a Feferman-Vaught-type theorem that is constructive and still works for unbounded partitions.
{"title":"Where First-Order and Monadic Second-Order Logic Coincide","authors":"Michael Elberfeld, Martin Grohe, Till Tantau","doi":"10.1109/LICS.2012.37","DOIUrl":"https://doi.org/10.1109/LICS.2012.37","url":null,"abstract":"We study on which classes of graphs first-order logic (FO) and monadic second-order logic (MSO) have the same expressive power. We show that for each class of graphs that is closed under taking subgraphs, FO and MSO have the same expressive power on the class if, and only if, it has bounded tree depth. Tree depth is a graph invariant that measures the similarity of a graph to a star in a similar way that tree width measures the similarity of a graph to a tree. For classes just closed under taking induced subgraphs, we show an analogous result for guarded second-order logic (GSO), the variant of MSO that not only allows quantification over vertex sets but also over edge sets. A key tool in our proof is a Feferman-Vaught-type theorem that is constructive and still works for unbounded partitions.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"70 1","pages":"265-274"},"PeriodicalIF":0.0,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79172182","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}
We prove that it is decidable whether a regular unranked tree language is definable in FO2(
证明了正则无秩树语言在FO2(
{"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}
The /spl lambda//spl mu/-calculus is an extension of the /spl lambda/-calculus introduced in 1992 by Parigot (M. Parigot, 1992) in order to generalize the Curry-Howard isomorphism to classical logic. Two versions of the calculus are usually considered in the literature: Parigot's original syntax and an alternative syntax introduced by de Groote. In 2001, David and Py (R. David, 2001) proved that the Separation Property (also referred to as Bohm theorem) fails for Parigot's /spl lambda//spl mu/-calculus. By analyzing David & Py's result, we exhibit an extension of Parigot's /spl lambda//spl mu/-calculus, the /spl Lambda//spl mu/-calculus, for which the Separation Property holds and which is built as an intermediate language between Parigot's and de Groote's /spl lambda//spl mu/-calculi. We prove the theorem and describe how /spl Lambda//spl mu/-calculus can be considered as a calculus of terms and streams. We then illustrate Separation in showing how in /spl Lambda//spl mu/-calculus it is possible to separate the counter-example used by David & Py.
{"title":"Separation with Streams in the lambdaµ-calculus","authors":"A. Saurin","doi":"10.1109/LICS.2005.48","DOIUrl":"https://doi.org/10.1109/LICS.2005.48","url":null,"abstract":"The /spl lambda//spl mu/-calculus is an extension of the /spl lambda/-calculus introduced in 1992 by Parigot (M. Parigot, 1992) in order to generalize the Curry-Howard isomorphism to classical logic. Two versions of the calculus are usually considered in the literature: Parigot's original syntax and an alternative syntax introduced by de Groote. In 2001, David and Py (R. David, 2001) proved that the Separation Property (also referred to as Bohm theorem) fails for Parigot's /spl lambda//spl mu/-calculus. By analyzing David & Py's result, we exhibit an extension of Parigot's /spl lambda//spl mu/-calculus, the /spl Lambda//spl mu/-calculus, for which the Separation Property holds and which is built as an intermediate language between Parigot's and de Groote's /spl lambda//spl mu/-calculi. We prove the theorem and describe how /spl Lambda//spl mu/-calculus can be considered as a calculus of terms and streams. We then illustrate Separation in showing how in /spl Lambda//spl mu/-calculus it is possible to separate the counter-example used by David & Py.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"45 1","pages":"356-365"},"PeriodicalIF":0.0,"publicationDate":"2005-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89194992","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}
Uniform reduction for pairs originates from abstract logic but it has not been studied much in the context of finite model theory. The paper demonstrates its relationship to locality. The first part of the paper is motivated by the question when first-order logic extended with quantifiers is Hanf-local. Two properties, tolerant Hanf-locality and separable Hanf-locality are defined, both of which ensure this if all quantifiers in question have the property. It is shown that all regular Hanf-local logics not tolerantly Hanf-local have weak version of uniform reduction for pairs. In the rest of the paper, relationship between different forms of locality, regularity and uniform reduction is studied in the class of finite directed trees.
{"title":"On locality and uniform reduction","authors":"H. Niemisto","doi":"10.1109/LICS.2005.32","DOIUrl":"https://doi.org/10.1109/LICS.2005.32","url":null,"abstract":"Uniform reduction for pairs originates from abstract logic but it has not been studied much in the context of finite model theory. The paper demonstrates its relationship to locality. The first part of the paper is motivated by the question when first-order logic extended with quantifiers is Hanf-local. Two properties, tolerant Hanf-locality and separable Hanf-locality are defined, both of which ensure this if all quantifiers in question have the property. It is shown that all regular Hanf-local logics not tolerantly Hanf-local have weak version of uniform reduction for pairs. In the rest of the paper, relationship between different forms of locality, regularity and uniform reduction is studied in the class of finite directed trees.","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"80 1","pages":"41-50"},"PeriodicalIF":0.0,"publicationDate":"2005-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84101765","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：