An approximation algorithm for querying inconsistent knowledge bases

Several medical applications deal with inconsistent knowledge bases, namely information that possibly violates given constraints, as they may not be enforced or satisfied. For instance, inconsistency may arise in clinical data integration, where multiple autonomous sources are integrated together: even if the sources are separately consistent, the integrated database may be inconsistent. A challenging problem in inconsistent clinical knowledge base management is extracting reliable information. The goal is to return reliable answers to queries even the presence of inconsistent background data. In this regard, the majority of the proposals are based on consistent query answering approach, where query answers are those obtained from all repairs, , that are maximal consistent subsets of the knowledge base's facts. We present a sound and polynomial-time approximation gorithm for solving the coNP-complete problem of consistent query answering. Our approach returns more consistent answers compared to those returned by state-of-the-art approaches, as they might discard facts including useful information.