The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of satisfiability in non-iterated and iterated probabilistic logics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8305942416191101
0 references
0.769130289554596
0 references
0.7599590420722961
0 references
0.7581643462181091
0 references
