Nonmonotonic Reasoning as Prioritized Argumentation
暂无分享,去创建一个
[1] Antonis C. Kakas,et al. Computing the Acceptability Semantics , 1995, LPNMR.
[2] Matthew L. Ginsberg,et al. Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.
[3] Li-Yan Yuan,et al. Compiling Defeasible Inheritance Networks to General Logic Programs , 1999, Artif. Intell..
[4] Victor W. Marek,et al. Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.
[5] Judea Pearl,et al. System Z: a Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning^ , 1990 .
[6] Phan Minh Dung,et al. An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..
[7] Victor W. Marek,et al. Relating Autoepistemic and Default Logics , 1989, KR.
[8] Gerhard Brewka,et al. Adding Priorities and Specificity to Default Logic , 1994, JELIA.
[9] Torsten Schaub,et al. Alternative Approaches to Default Logic , 1994, Artif. Intell..
[10] Y. Shoham. Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .
[11] Li-Yan Yuan,et al. Nonmonotonic Reasoning by Monotonic Inference with Priority Constraints , 1996, NMELP.
[12] Li-Yan Yuan,et al. On the Equivalence of Semantics for Normal Logic Programs , 1995, J. Log. Program..
[13] Antonis C. Kakas,et al. The role of abduction in logic programming , 1998 .
[14] Robert A. Kowalski,et al. Abduction Compared with Negation by Failure , 1989, ICLP.
[15] Tomasz Imielinski,et al. Results on Translating Defaults to Circumscription , 1985, IJCAI.
[16] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[17] Georg Gottlob,et al. A Comparison of Some Schemes for Translating Logic to C , 1994, ICLP Workshop: Parallel and Data Parallel Execution of Logic Programs.
[18] Chiaki Sakama,et al. Representing Priorities in Logic Programs , 1996, JICSLP.
[19] Gordon I. McCalla,et al. The knowledge frontier: essays in the representation of knowledge , 1987 .
[20] Kannan Govindarajan,et al. Preference Logic Programming , 1995, ICLP.
[21] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..
[22] Vladimir Lifschitz,et al. On Open Defaults , 1990 .
[23] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..
[24] Pascal Van Hentenryck. The Acceptability Semantics for Logic Programs , 1994 .
[25] Evelina Lamma,et al. Normal logic programs as open positive programs , 1992, CNKBS.
[26] Jia-Huai You,et al. Logic programming without default negation revisited , 1997, 1997 IEEE International Conference on Intelligent Processing Systems (Cat. No.97TH8335).
[27] Torsten Schaub,et al. Compiling Reasoning with and about Preferences into Default Logic , 1997, IJCAI.
[28] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[29] Phan Minh Dung,et al. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..
[30] Henry Prakken,et al. A logical framework for modelling legal argument , 1993, International Conference on Artificial Intelligence and Law.
[31] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[32] Tran Cao Son,et al. Nonmonotonic Inheritance, Argumentation and Logic Programming , 1995, LPNMR.
[33] Luigi Portinale,et al. On the role of abduction , 1995, CSUR.
[34] Alberto O. Mendelzon,et al. Managing conflicts between rules (extended abstract) , 1996, PODS '96.
[35] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1989, J. Comput. Syst. Sci..
[36] Raymond Reiter,et al. On Inheritance Hierarchies With Exceptions , 1983, AAAI.
[37] Alberto O. Mendelzon,et al. Managing Conflicts Between Rules , 1999, J. Comput. Syst. Sci..
[38] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[39] Fangzhen Lin,et al. Argument Systems: A Uniform Basis for Nonmonotonic Reasoning , 1989, KR.
[40] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[41] John W. Lloyd. Logic Programming without Negation as Failure , 1995 .
[42] R. Reiter. On Closed World Data Bases , 1987, Logic and Data Bases.
[43] Toshiro Wakayama,et al. Constraint Optimization using Preference Logics: A New Role for Modal Logic , 1993, PPCP.
[44] Li-Yan Yuan,et al. Circumscription by Inference Rules with Priority , 1996, ECAI.
[45] John L. Pollock,et al. Defeasible Reasoning , 2020, Synthese Library.
[46] Phan Minh Dung,et al. An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..
[47] Francesco Buccafurri,et al. Stable Models and Their Computation for Logic Programming with Inheritance and True Negation , 1996, J. Log. Program..
[48] S. Mantha. First-order preference theories and their applications , 1992 .
[49] Lee Naish. Disjunctive Logic Programming as Constrained Inferences , 1997 .
[50] Giovanni Sartor. A simple computational model for nonmonotonic and adversarial legal reasoning , 1993, ICAIL '93.
[51] Randy Goebel,et al. Theorist: A Logical Reasoning System for Defaults and Diagnosis , 1987 .
[52] Katsumi Inoue,et al. Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..
[53] Raymond Reiter,et al. On Interacting Defaults , 1981, IJCAI.