The complexity of non-iterated probabilistic justification logic (Q2807085)
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 non-iterated probabilistic justification logic |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of non-iterated probabilistic justification logic |
scientific article |
Statements
The Complexity of Non-Iterated Probabilistic Justification Logic (English)
0 references
19 May 2016
0 references
justification logic
0 references
probabilistic logic
0 references
complexity
0 references
derivability
0 references
satisfiability
0 references
0.8305942416191101
0 references
0.8192068934440613
0 references
0.8139927983283997
0 references
0.8062573075294495
0 references
0.7689325213432312
0 references
