论文信息 - Closed-World Databases and Circumscription

Closed-World Databases and Circumscription

Abstract 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.

Vladimir Lifschitz | V. Lifschitz

[1] Raymond Reiter,et al. Equality and Domain Closure in First-Order Databases , 1980, JACM.

[2] Robert E. Mercer,et al. On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

[3] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[4] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.

[5] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[6] John McCarthy,et al. SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[7] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.

[8] John C. Shepherdson,et al. Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..