Name
Abstract | ||
|---|---|---|
We classify the computational complexity of the satisfiability, validity, and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3157054 | ACM Transactions on Computational Logic |
Keywords | Field | DocType |
Propositional logic, dependence, inclusion, independence, model checking, satisfiability, team semantics, validity | Discrete mathematics,T-norm fuzzy logics,Autoepistemic logic,Zeroth-order logic,Algorithm,Classical logic,Resolution (logic),Well-formed formula,Mathematics,Intermediate logic,Propositional variable | Journal |
Volume | Issue | ISSN |
19 | 1 | 1529-3785 |
Citations | PageRank | References |
2 | 0.37 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miika Hannula | 1 | 66 | 10.10 |
| Juha Kontinen | 2 | 176 | 24.67 |
| Jonni Virtema | 3 | 79 | 11.93 |
| Heribert Vollmer | 4 | 805 | 71.64 |