|
Volumn 86, Issue 1, 1996, Pages 157-170
|
Polynomial solvability of cost-based abduction
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
HEURISTIC METHODS;
HEURISTIC PROGRAMMING;
INTEGER PROGRAMMING;
LINEAR PROGRAMMING;
POLYNOMIALS;
PROBABILITY;
PROBLEM SOLVING;
BAYESIAN NETWORKS;
COST BASED ABDUCTION PROBLEMS;
DIRECTED ACYCLIC GRAPHS;
NEGATIVE LOG PROBABILITIES;
NETWORK FLOW ANALYSIS;
ARTIFICIAL INTELLIGENCE;
|
EID: 0030246424
PISSN: 00043702
EISSN: None
Source Type: Journal
DOI: 10.1016/0004-3702(96)00016-1 Document Type: Article |
Times cited : (30)
|
References (11)
|