The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of satisfiability in non-iterated and iterated probabilistic logics |
scientific article |
Statements
The complexity of satisfiability in non-iterated and iterated probabilistic logics (English)
0 references
21 September 2018
0 references
probabilistic logic
0 references
computational complexity
0 references
satisfiability
0 references
justification logic
0 references
