Handling indefinite and negative data in a deductive database

摘要

We introduce the notion of a minimal interpretation of an indefinite deductive database and present a closed world metarule based on this notion with which negative data may be inferred from the database. We also investigate a possible implementation of our metarule using a path checking algorithm adapted from Bibel's connection method.