The complexity of handling minimal solutions in logic-based abduction (Q5262485)
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 6458861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of handling minimal solutions in logic-based abduction |
scientific article; zbMATH DE number 6458861 |
Statements
The complexity of handling minimal solutions in logic-based abduction (English)
0 references
15 July 2015
0 references
computational complexity
0 references
counting complexity
0 references
propositional abduction
0 references
closed-world assumption
0 references
0.9988866448402404
0 references
0.8666104674339294
0 references
0.8617244362831116
0 references
0.8018707036972046
0 references
