Reasoning on Open Domains
暂无分享,去创建一个
[1] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.
[2] Raymond Reiter,et al. Equality and Domain Closure in First-Order Databases , 1980, JACM.
[3] Kenneth A. Ross,et al. A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..
[4] Hector J. Levesque. Making Believers out of Computers , 1989 .
[5] Sarit Kraus,et al. Nonmonotonicity and the Scope of Reasoning , 1991, Artif. Intell..
[6] R. Reiter. On Closed World Data Bases , 1987, Logic and Data Bases.
[7] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[8] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.
[9] Michael Gelfond,et al. Strong Introspection , 1991, AAAI.
[10] Teodor C. Przymusinski,et al. On the relationship between CWA, minimal model, and minimal herbrand model semantics , 1990, Int. J. Intell. Syst..
[11] Vladimir Lifschitz,et al. On Open Defaults , 1990 .