Computing protected circumscription

Bossu, 1985, Saturation, Nonmonotonic Reasoning, and the Closed-World Assumption, Artificial Intelligence, 25, 13, 10.1016/0004-3702(85)90040-2 Clark, 1978, Negation as Failure, 293 Etherington, D. Personal communication, Week of Logic and AI, Univ. of Maryland, 1984. Etherington, 1984, On the Adequacy of Predicate Circumscription for Closed-World Reasoning, Tech. Report 84-5, Dept. of Computer Science, Univ. of British Columbia Grant, 1984, Answering Queries in Indefinite Databases and the Null Value Problem, Tech. Report 1374, Univ. of Maryland Henschen, L. and Yahya, Deduction in Non-Horn Databases, J. Automated Reasoning, to appear. Lifschitz, 1984, Some Results on Circumscription McCarthy, 1980, Circumscription—a Form of Non-monotonic Reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 McCarthy, 1984, Applications of Circumscription to Formalizing Common Sense Knowledge Minker, 1982, On Indefinite Databases and the Closed-World Assumption, Vol. 138, 292 Minker, 1983, On Theories of Definite and Indefinite Databases, Tech. Report, Univ. of Maryland Minker, 1984, Applications of Protected Circumscription, Vol. 170, 414 Minker, 1984, Protected Circumscription Perlis, D. and Minker, J. Completeness Results for Circumscription, in preparation. Reiter, 1978, On Closed World Databases, 55 Reiter, R. Equality and Domain Closure in First-Order Databases, J. Assoc. Comput. Mach. 27:235–249. Reiter, 1982, Circumscription Implies Predicate Completion (Sometimes), 418 Zaniolo, 1984, Database Relations with Null Values, J. Comput. System Sci., 28, 142, 10.1016/0022-0000(84)90080-1