An algorithm to compute circumscription
- 28 February 1989
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 38 (1) , 49-73
- https://doi.org/10.1016/0004-3702(89)90067-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- Applications of circumscription to formalizing common-sense knowledgeArtificial Intelligence, 1986
- Closed-world databases and circumscriptionArtificial Intelligence, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Semantical considerations on nonmonotonic logicArtificial Intelligence, 1985
- On the adequacy of predicate circumscription for closed‐world reasoningComputational Intelligence, 1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- Non-monotonic logic IArtificial Intelligence, 1980
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980
- A logic for default reasoningArtificial Intelligence, 1980