A Complete Classification of the Complexity of Propositional Abduction (Q5470752)
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: A Complete Classification of the Complexity of Propositional Abduction |
scientific article; zbMATH DE number 5029589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Complete Classification of the Complexity of Propositional Abduction |
scientific article; zbMATH DE number 5029589 |
Statements
A Complete Classification of the Complexity of Propositional Abduction (English)
0 references
1 June 2006
0 references
abduction
0 references
propositional logic
0 references
complexity
0 references
Boolean constraints
0 references
0.9033837914466858
0 references
0.8908253312110901
0 references
0.8736275434494019
0 references
0.8555862307548523
0 references
