Abducing Priorities to Derive Intended Conclusions
暂无分享,去创建一个
[1] T. Wakaki. Finding Priorities of Circunscription Policy as a Skeptical Explanation in Abduction , 1998 .
[2] Paolo Mancarella,et al. Database Updates through Abduction , 1990, VLDB.
[3] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[4] Michael Gelfond,et al. Compiling circumscriptive theories into logic programs: preliminary report , 1988, AAAI 1988.
[5] Katsumi Inoue,et al. Learning Abductive and Nonmonotonic Logic Programs , 2000 .
[6] Chiaki Sakama,et al. Representing Priorities in Logic Programs , 1996, JICSLP.
[7] Norman Y. Foo,et al. Updating Logic Programs , 1998, ECAI.
[8] Katsumi Inoue,et al. Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..
[9] Michael Gelfond,et al. Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.
[10] John W. Lloyd. Logic Programming without Negation as Failure , 1995 .
[11] Chiaki Sakama,et al. A Fixpoint Characterization of Abductive Logic Programs , 1996, J. Log. Program..
[12] Georg Gottlob,et al. The Complexity of Logic-Based Abduction , 1993, STACS.
[13] Gerhard Brewka. Reasoning about Priorities in Default Logic , 1994, AAAI.
[14] Thomas Eiter,et al. Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..
[15] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.
[16] Drew McDermott,et al. Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..