The flattening operator F increases the expressive power of unary inclusion and unary anonymity logics, but the submitted proofs for the inclusion-logic equivalence and the anonymity separation contain critical gaps.
Modular SAT-based techniques for reasoning tasks in team semantics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.
fields
cs.LO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The flattening operator in team-based logics
The flattening operator F increases the expressive power of unary inclusion and unary anonymity logics, but the submitted proofs for the inclusion-logic equivalence and the anonymity separation contain critical gaps.