The problem of asking the minimum number of questions in Horn clause systems (Q1344638)
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 722507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of asking the minimum number of questions in Horn clause systems |
scientific article; zbMATH DE number 722507 |
Statements
The problem of asking the minimum number of questions in Horn clause systems (English)
0 references
18 September 1995
0 references
question asking strategies
0 references
inference engine
0 references
backward chaining
0 references
set cover problem
0 references
strategies in expert systems
0 references
Horn clause rule bases
0 references
heuristic approach
0 references
0.8207565546035767
0 references
0.7155500650405884
0 references
0.6916967630386353
0 references
0.685869038105011
0 references
0.685819685459137
0 references
