Name
Abstract | ||
|---|---|---|
We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence and inclusion logic and their extensions by the classical negation. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48057-1_21 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Propositional logic,Team semantics,Dependence,Independence,Inclusion,Satisfiability,Validity,Model-checking | Intuitionistic logic,Discrete mathematics,Autoepistemic logic,Computer science,Zeroth-order logic,Negation introduction,Resolution (logic),Well-formed formula,Intermediate logic,Propositional variable | Journal |
Volume | ISSN | Citations |
9234 | 0302-9743 | 12 |
PageRank | References | Authors |
0.71 | 6 | 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 |