Supposition-Based Logic for Automated Nonmontonic Reasoning
暂无分享,去创建一个
[1] Pierre Siegel,et al. Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..
[2] Patrice Quinton,et al. A Theorem-Prover for a Decidable Subset of Default Logic , 1983, AAAI.
[3] Robert A. Kowalski,et al. Semantic Trees in Automatic Theorem-Proving , 1983 .
[4] Pierre Siegel,et al. Nonmonotonic Reasoning and Databases , 1982, Advances in Data Base Theory.
[5] Robert E. Mercer,et al. On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..
[6] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[7] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[8] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[9] R. Kowalski,et al. Linear Resolution with Selection Function , 1971 .