Representing Priorities in Logic Programs
暂无分享,去创建一个
[1] Vladimir Lifschitz,et al. On the Satisfiability of Circumscription , 1986, Artif. Intell..
[2] John W. Lloyd. Logic Programming without Negation as Failure , 1995 .
[3] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[4] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..
[5] Chiaki Sakama,et al. Embedding Circumscriptive Theories in General Disjunctive Programs , 1995, LPNMR.
[6] Teodor C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..
[7] Vladimir Lifschitz,et al. Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.
[8] Katsumi Inoue,et al. Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..
[9] Gerhard Brewka. Reasoning about Priorities in Default Logic , 1994, AAAI.
[10] David Poole,et al. A Logical Framework for Default Reasoning , 1988, Artif. Intell..
[11] Georg Gottlob,et al. Complexity Results for Abductive Logic Programming , 1995, LPNMR.
[12] Chiaki Sakama,et al. On Positive Occurrences of Negation as Failure , 1994, KR.
[13] Michael Gelfond,et al. Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.