Modular SAT-based techniques for reasoning tasks in team semantics

DOI10.1016/J.JCSS.2024.103575MaRDI QIDQ6615313FDOQ6615313

Authors Arnaud Durand, Juha Kontinen, Jouko Väänänen

Publication date 8 October 2024

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

team semanticsBoolean satisfiabilitydata complexity

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 6680142 (Why is no real title available?)
• scientific article; zbMATH DE number 43047 (Why is no real title available?)
• An algorithm for horizontal decompositions
• Capturing complexity classes by fragments of second-order logic
• Coherence and computational complexity of quantifier-free dependence logic formulas
• Counting in team semantics
• Counting of Teams in First-Order Team Logics
• Dependence and Independence in Social Choice: Arrow’s Theorem
• Dependence and independence
• Dependence logic vs. constraint satisfaction
• Dependence logic. A new approach to independence friendly logic
• Enumerating teams in first-order team logics
• Enumeration complexity of poor man's propositional dependence logic
• Facets of distribution identities in probabilistic team semantics
• Hierarchies in independence logic
• Identifying independence in bayesian networks
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Inquisitive logic
• Model-checking games for logics of imperfect information
• On generating all solutions of generalized satisfiability problems
• Probabilistic team semantics
• Questions and dependency in intuitionistic logic
• Tractability Frontier of Data Complexity in Team Semantics

This page was built for publication: Modular SAT-based techniques for reasoning tasks in team semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615313)