On the adequacy of predicate circumscription for closed‐world reasoning
David W. Etherington, Robert E. Mercer, Raymond Reiter · Computational Intelligence · 1985
We focus on McCarthy's method of predicate circumscription in order to establish various results about its consistency, and about its ability to conjecture new information. A basic result is that predicate circumscription cannot account for the standard kinds of default reasoning. Another is that predicate circumscription yields no new information about the equality predicate. This has important consequences for the unique names and domain closure assumptions.