Closed-world databases and circumscription

摘要

We compare two forms of non-monotonic reasoning: closed-world evaluation of queries in databases and circumscription. For closed E-saturated databases we show that the closed-world assumption, if consistent, is equivalent to circumscribing all predicates in the database.