2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第7页

Inapproximability of Unique Games in Fixed-Point Logic with Counting 计数不动点逻辑中唯一对策的不可逼近性

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-04-09 DOI: 10.1109/LICS52264.2021.9470706

Jamie Tucker-Foltz

引用次数: 1

Parameterized Complexity of Elimination Distance to First-Order Logic Properties 一阶逻辑性质消去距离的参数化复杂度

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-04-07 DOI: 10.1109/LICS52264.2021.9470540

F. Fomin, P. Golovach, D. Thilikos

{"title":"Parameterized Complexity of Elimination Distance to First-Order Logic Properties","authors":"F. Fomin, P. Golovach, D. Thilikos","doi":"10.1109/LICS52264.2021.9470540","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470540","url":null,"abstract":"The elimination distance to some target graph property ${mathcal{P}}$ is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We delimit the problem’s fixed-parameter tractability by identifying sufficient and necessary conditions on the structure of prefixes of first-order logic formulas. Our main result is the following meta-theorem: For every graph property ${mathcal{P}}$ expressible by a first order-logic formula φ ∈ Σ3, that is, of the formbegin{equation*}varphi = exists {x_1}exists {x_2} cdots exists {x_r}forall {y_1}forall {y_2} cdots forall {y_s}quad exists {z_1}exists {z_2} cdots exists {z_t},psi ,end{equation*}where ψ is a quantifier-free first-order formula, checking whether the elimination distance of a graph to ${mathcal{P}}$ does not exceed k, is fixed-parameter tractable parameterized by k. Properties of graphs expressible by formulas from Σ3 include being of bounded degree, excluding a forbidden subgraph, or containing a bounded dominating set. We complement this theorem by showing that such a general statement does not hold for formulas with even slightly more expressive prefix structure: There are formulas φ ∈ Π3, for which computing elimination distance is W[2]-hard.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238417","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}

引用次数: 8

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata 轨道-有限维向量空间与加权寄存器自动机

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-04-06 DOI: 10.1109/LICS52264.2021.9470634

Mikolaj Boja'nczyk, Bartek Klin, Joshua Moerman

引用次数: 7

Supermartingales, Ranking Functions and Probabilistic Lambda Calculus 上鞅，排序函数和概率λ演算

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-22 DOI: 10.1109/LICS52264.2021.9470550

Andrew Kenyon-Roberts, C. Ong

{"title":"Supermartingales, Ranking Functions and Probabilistic Lambda Calculus","authors":"Andrew Kenyon-Roberts, C. Ong","doi":"10.1109/LICS52264.2021.9470550","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470550","url":null,"abstract":"We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking functions have weaker restrictions on how fast they must decrease, and are applicable to a wider range of programs. Sparse ranking functions take values only at a subset of the program’s reachable states, so they are simpler to define and more flexible. Ranking functions with respect to alternative reduction strategies give yet more flexibility, and significantly increase the applicability of the ranking supermartingale approach to proving almost sure termination, thanks to a novel (restricted) confluence result which is of independent interest. The notion of antitone ranking function was inspired by similar work by McIver, Morgan, Kaminski and Katoen in the setting of a first-order imperative language, but adapted to a higher-order functional language. The sparse ranking function and confluent semantics extensions are unique to the higher-order setting. Our methods can be used to prove almost sure termination of programs that are beyond the reach of methods in the literature, including higher-order and non-affine recursion.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129641145","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}

引用次数: 4

Strong Call-by-Value is Reasonable, Implosively 强按值调用是合理的，内爆的

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-13 DOI: 10.1109/LICS52264.2021.9470630

Beniamino Accattoli, Andrea Condoluci, C. Coen

{"title":"Strong Call-by-Value is Reasonable, Implosively","authors":"Beniamino Accattoli, Andrea Condoluci, C. Coen","doi":"10.1109/LICS52264.2021.9470630","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470630","url":null,"abstract":"Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is a delicate problem, which depends on the notion of evaluation strategy. Since the nineties, it is known that weak (that is, out of abstractions) call-by-value evaluation is a reasonable strategy while Lévy's optimal parallel strategy, which is strong (that is, it reduces everywhere), is not. The strong case turned out to be subtler than the weak one. In 2014 Accattoli and Dal Lago have shown that strong call-by-name is reasonable, by introducing a new form of useful sharing and, later, an abstract machine with an overhead quadratic in the number of β-steps.Here we show that also strong call-by-value evaluation is reasonable for time, via a new abstract machine realizing useful sharing and having a linear overhead. Moreover, our machine uses a new mix of sharing techniques, adding on top of useful sharing a form of implosive sharing, which on some terms brings an exponential speed-up. We give examples of families that the machine executes in time logarithmic in the number of β-steps.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116323185","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

Responsibility and verification: Importance value in temporal logics 责任和验证:时间逻辑中的重要价值

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-12 DOI: 10.1109/LICS52264.2021.9470597

Corto Mascle, C. Baier, Florian Funke, Simon Jantsch, S. Kiefer

引用次数: 2

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames 可证明性逻辑的零-一定律:几乎所有模型和几乎所有框架的公理化有效性

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-11 DOI: 10.1109/LICS52264.2021.9470666

R. Verbrugge

{"title":"Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames","authors":"R. Verbrugge","doi":"10.1109/LICS52264.2021.9470666","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470666","url":null,"abstract":"It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. For modal logics, limit behavior for models and frames may differ. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5. They also proposed zero-one laws for the corresponding classes of frames, but their zero-one law for K-frames has since been disproved.In this paper, we prove zero-one laws for provability logic with respect to both model and frame validity. Moreover, we axiomatize validity in almost all irreflexive transitive finite models and in almost all irreflexive transitive finite frames, leading to two different axiom systems. In the proofs, we use a combinatorial result by Kleitman and Rothschild about the structure of almost all finite partial orders. On the way, we also show that a previous result by Halpern and Kapron about the axiomatization of almost sure frame validity for S4 is not correct. Finally, we consider the complexity of deciding whether a given formula is almost surely valid in the relevant finite models and frames.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327529","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

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory 具有延迟跟踪的图形语言:有限内存的量子计算图像

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-05 DOI: 10.1109/LICS52264.2021.9470553

T. Carette, Marc de Visme, S. Perdrix

引用次数: 4

Commutative Monads for Probabilistic Programming Languages 概率编程语言的可交换单子

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-02-01 DOI: 10.1109/LICS52264.2021.9470611

Xiaodong Jia, B. Lindenhovius, M. Mislove, Vladimir Zamdzhiev

引用次数: 15

On the Expressive Power of Homomorphism Counts 论同态计数的表达能力

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2021-01-30 DOI: 10.1109/LICS52264.2021.9470543

Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu

{"title":"On the Expressive Power of Homomorphism Counts","authors":"Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu","doi":"10.1109/LICS52264.2021.9470543","DOIUrl":"https://doi.org/10.1109/LICS52264.2021.9470543","url":null,"abstract":"A classical result by Lovász asserts that two graphs G and H are isomorphic if and only if they have the same left profile, that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H. Dvorák and later on Dell, Grohe, and Rattan showed that restrictions of the left profile to a class of graphs can capture several different relaxations of isomorphism, including equivalence in counting logics with a fixed number of variables (which contains fractional isomorphism as a special case) and co-spectrality (i.e., two graphs having the same characteristic polynomial). On the other side, a result by Chaudhuri and Vardi asserts that isomorphism is also captured by the right profile, that is, two graphs G and H are isomorphic if and only if for every graph F, the number of homomorphisms from G to F coincides with the number of homomorphisms from H to F. In this paper, we embark on a study of the restrictions of the right profile by investigating relaxations of isomorphism that can or cannot be captured by restricting the right profile to a fixed class of graphs. Our results unveil striking differences between the expressive power of the left profile and the right profile. We show that fractional isomorphism, equivalence in counting logics with a fixed number of variables, and co-spectrality cannot be captured by restricting the right profile to a class of graphs. In the opposite direction, we show that chromatic equivalence cannot be captured by restricting the left profile to a class of graphs, while, clearly, it can be captured by restricting the right profile to the class of all cliques.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130768756","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}

引用次数: 11