An efficient method for eliminating varying predicates from a circumscription
- 30 April 1992
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 54 (3) , 397-410
- https://doi.org/10.1016/0004-3702(92)90051-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Eliminating the fixed predicates from a circumscriptionArtificial Intelligence, 1989
- A circumscriptive theorem proverArtificial Intelligence, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- An algorithm to compute circumscriptionArtificial Intelligence, 1989
- 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
- On the adequacy of predicate circumscription for closed‐world reasoningComputational Intelligence, 1985
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980