Tractability Frontier of Data Complexity in Team Semantics-Reference-Cited by-同舟云学术

Tractability Frontier of Data Complexity in Team Semantics

Published:2022-01-31 Issue:1 Volume:23 Page:1-21
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Durand Arnaud¹,Kontinen Juha²,De Rugy-Altherre Nicolas³,Väänänen Jouko⁴

Affiliation:

1. IMJ-PRG, Université de Paris and CNRS, Paris, France

2. Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland

3. Computer Science Department, Université de Lorraine, Vand.uvre-lès-Nancy, France

4. Department of Mathematics and Statistics, University of Helsinki and Institute for Logic, Language and Computation, University of Amsterdam, Helsinki, Finland

Abstract

We study the data complexity of model checking for logics with team semantics. We focus on dependence, inclusion, and independence logic formulas under both strict and lax team semantics. Our results delineate a clear tractability/intractability frontiers in data complexity of both quantifier-free and quantified formulas for each of the logics. For inclusion logic under the lax semantics, we reduce the model-checking problem to the satisfiability problem of so-called dual-Horn Boolean formulas. Via this reduction, we give an alternative proof for the known result that the data complexity of inclusion logic is in PTIME.

Funder

Academy of Finland

Faculty of Science of the University of Helsinki and the Academy of Finland

European Research Council

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3471618

Reference25 articles.

1. Arnaud Durand Miika Hannula Juha Kontinen Arne Meier and Jonni Virtema. 2018. Probabilistic team semantics. In Foundations of Informatics and Knowledge Systems . Lecture Notes in Computer Science Vol. 10833. Springer 186–206. DOI: https://doi.org/10.1007/978-3-319-90050-6_11

2. Hierarchies in dependence logic;Durand Arnaud;ACM Transactions on Computational Logic,2012

3. Inclusion and exclusion dependencies in team semantics: On some logics of imperfect information;Galliani Pietro;Annals of Pure and Applied Logic,2012

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Modular SAT-based techniques for reasoning tasks in team semantics;Journal of Computer and System Sciences;2024-12

2. Parameterized complexity of weighted team definability;Mathematical Structures in Computer Science;2024-02-20

3. Logics with Probabilistic Team Semantics and the Boolean Negation;Logics in Artificial Intelligence;2023