Premium
On the adequacy of predicate circumscription for closed‐world reasoning
Author(s) -
Etherington David W.,
Mercer Robert E.,
Reiter Raymond
Publication year - 1985
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1985.tb00055.x
Subject(s) - circumscription , predicate (mathematical logic) , computer science , mathematics , artificial intelligence , natural language processing , programming language
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.