Computing minimum cost diagnoses to repair populated DL-based ontologies.
Jianfeng DuYi-Dong ShenPublished in: WWW (2008)
Keyphrases
- minimum cost
- np hard
- approximation algorithms
- description logics
- network flow problem
- network flow
- spanning tree
- dl lite
- capacity constraints
- knowledge base
- ontology languages
- ontological reasoning
- semantic web
- owl ontologies
- description logic programs
- dl programs
- knowledge representation
- domain ontology
- owl dl
- computational complexity
- undirected graph
- model based diagnosis
- upper bound
- domain knowledge
- lower bound
- medical terminology
- network simplex algorithm