Satisfiability of propositional logic with nonemptiness atom NE in team semantics is NP-complete, validity coNP-complete, and model checking polynomial-time.
In: Logic, methodology and philosophy of science, VIII (Moscow, 1987), Stud
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Satisfiability of propositional logic with nonemptiness atom NE in team semantics is NP-complete, validity coNP-complete, and model checking polynomial-time.