On the adequacy of predicate circumscription for closed‐world reasoning
- 1 January 1985
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 1 (1) , 11-15
- https://doi.org/10.1111/j.1467-8640.1985.tb00055.x
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- Equality and Domain Closure in First-Order DatabasesJournal of the ACM, 1980
- Logic for Data DescriptionPublished by Springer Nature ,1978
- On Closed World Data BasesPublished by Springer Nature ,1978
- Negation as FailurePublished by Springer Nature ,1978
- On reasoning by defaultPublished by Association for Computational Linguistics (ACL) ,1978