Abduction in well-founded semantics and generalized stable models via tabled dual programs
暂无分享,去创建一个
[1] Pietro Torasso,et al. On the Relationship between Abduction and Deduction , 1991, J. Log. Comput..
[2] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[3] K. A. Ross,et al. Tabled Evaluation with Delaying for General Logic Programs , 1996 .
[4] Bert Van Nuffelen,et al. Problem solving in ID-logic with aggregates: some experiments , 2000, arXiv.org.
[5] Gerald Pfeifer,et al. A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.
[6] Kenneth A. Ross,et al. Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.
[7] José Júlio Alferes,et al. Derivation Procedures for Extended Stable Models , 1991, IJCAI.
[8] Ofer Arieli,et al. Paraconsistent Semantics for Extended Logic Programs , 2002, IC-AI.
[9] Paolo Mancarella,et al. Abductive Logic Programming , 1992, LPNMR.
[10] Teodor C. Przymusinski. Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.
[11] Chiaki Sakama,et al. Abductive logic programming and disjunctive logic programming: their relationship and transferability , 2000, J. Log. Program..
[12] Chiaki Sakama,et al. Computing extended abduction through transaction programs , 1999, Annals of Mathematics and Artificial Intelligence.
[13] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[14] José Júlio Alferes,et al. Planning as Abductive Updating , 2001 .
[15] José Júlio Alferes,et al. Dynamic updates of non-monotonic knowledge bases , 2000, J. Log. Program..
[16] Paolo Mancarella,et al. Generalized Stable Models: A Semantics for Abduction , 1990, ECAI.
[17] Ilkka Niemelä,et al. Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.
[18] Luís Moniz Pereira,et al. Abduction over 3-Valued Extended Logic Programs , 1995, International Conference on Logic Programming and Non-Monotonic Reasoning.
[19] Danny De Schreye,et al. SLDNFA: An Abductive Procedure for Normal Abductive Programs , 1992, JICSLP.
[20] Vladimir Lifschitz,et al. From Disjunctive Programs to Abduction , 1994, NMELP.
[21] José Júlio Alferes,et al. Well-founded Abduction via Tabled Dual Programs , 1999, ICLP.
[22] Antonis C. Kakas,et al. ACLP: Flexible Solutions to Complex Problems , 1997, LPNMR.
[23] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[24] Ken Satoh,et al. Computing abduction by using TMS with top-down expectation , 2000, J. Log. Program..
[25] Georg Gottlob,et al. Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..
[26] Ken Satoh,et al. Computing Abduction by Using the TMS , 1991, ICLP.
[27] Luís Moniz Pereira,et al. Psychiatric Diagnosis from the Viewpoint of Computational Logic , 2000, Computational Logic.
[28] Georg Gottlob,et al. Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..
[29] Robert A. Kowalski,et al. The Iff Proof Procedure for Abductive Logic Programming , 1997, J. Log. Program..
[30] Theresa Swift,et al. A New Formulation of Tabled Resolution with Delay , 1999, EPIA.
[31] Dc Washington. Diagnostic and Statistical Manual of Mental Disorders, 4th Ed. , 1994 .
[32] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.