Modular SAT-based techniques for reasoning tasks in team semantics
From MaRDI portal
Publication:6615313
DOI10.1016/j.jcss.2024.103575MaRDI QIDQ6615313
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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking games for logics of imperfect information
- Inquisitive logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- An algorithm for horizontal decompositions
- Capturing complexity classes by fragments of second-order logic
- Probabilistic team semantics
- Enumeration complexity of poor man's propositional dependence logic
- Dependence and independence
- Coherence and computational complexity of quantifier-free dependence logic formulas
- Enumerating teams in first-order team logics
- Questions and dependency in intuitionistic logic
- Facets of distribution identities in probabilistic team semantics
- Hierarchies in independence logic
- On generating all solutions of generalized satisfiability problems
- Tractability Frontier of Data Complexity in Team Semantics
- Counting of Teams in First-Order Team Logics
- Identifying independence in bayesian networks
- Dependence and Independence in Social Choice: Arrow’s Theorem
- Dependence Logic vs. Constraint Satisfaction
- Counting in Team Semantics
This page was built for publication: Modular SAT-based techniques for reasoning tasks in team semantics
