An Efficient Method for Eliminating Varying Predicates from a Circumscription
暂无分享,去创建一个
[1] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[2] Matthew L. Ginsberg. A Circumscriptive Theorem Prover , 1989, Artif. Intell..
[3] Pierre Siegel,et al. Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..
[4] Vladimir Lifschitz,et al. Pointwise circumscription , 1987 .
[5] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[6] W. B. Pitt. Review: K. Jaakko Hintikka, Reductions in the Theory of Types , 1966 .
[7] Teodor C. Przymusinski. An Algorithm to Compute Circumscription , 1989, Artif. Intell..
[8] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[9] Michael Gelfond,et al. Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..
[10] Robert E. Mercer,et al. On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..
[11] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.
[12] Li-Yan Yuan,et al. On Reducing Parallel Circumscription , 1988, AAAI.
[13] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..
[14] Vladimir Lifschitz,et al. Closed-World Databases and Circumscription , 1987, Artif. Intell..
[15] John S. Schlipf,et al. Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..
[16] Kurt Konolige,et al. Eliminating the Fixed Predicates from a Circumscription , 1989, Artif. Intell..