Approximating cost-based abduction is NP-hard .

Ashraf M. Abdelbar

Published in: Artif. Intell. (2004)

Keyphrases

cost based abduction
np hard
np complete
optimal solution
lower bound
special case
approximation algorithms
scheduling problem
worst case
belief revision
computational complexity
bayesian networks
relational databases
databases
cluster analysis
knowledge base
artificial intelligence