Issue No. 01 - February (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.368510
<p><it>Abstract</it>—Databases and knowledge bases could be inconsistent in many ways. For example, during the construction of an expert system, we may consult many different experts. Each expert may provide us with a group of rules and facts which are self-consistent. However, when we coalesce the facts and rules provided by these different experts, inconsistency may arise. Alternatively, knowledge bases may be inconsistent due to the presence of some erroneous information. Thus, a framework for reasoning about knowledge bases that contain inconsistent information is necessary. Such a framework was described in [<ref rid="BIBK01771" type="bib">1</ref>], [<ref rid="BIBK017721" type="bib">21</ref>]. However, existing frameworks for reasoning with inconsistency do not support reasoning by cases and reasoning with the law of excluded middle (everything is either true or false). In this paper, we show how reasoning with cases, and reasoning with the law of excluded middle may be captured. We develop a declarative and operational semantics for knowledge bases that are possibly inconsistent. We compare and contrast our work with work on explicit and non-monotonic modes of negation in logic programs and suggest under what circumstances one framework may be preferred over another.</p>
Logic programming, deductive databases, reasoning with inconsistency, nonmonotonic negation.
V. Subrahmanian and J. Grant, "Reasoning in Inconsistent Knowledge Bases," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 177-189, 1995.