Probabilistic sentence satisfiability: an approach to PSAT (Q2287193)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7153705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic sentence satisfiability: an approach to PSAT |
scientific article; zbMATH DE number 7153705 |
Statements
Probabilistic sentence satisfiability: an approach to PSAT (English)
0 references
20 January 2020
0 references
PSAT
0 references
probabilistic knowledge base
0 references
nonlinear systems
0 references
0 references
0.7865505814552307
0 references
0.7865505814552307
0 references
0.7755363583564758
0 references
0.7682352662086487
0 references
0.7669979929924011
0 references
