A Tutorial on Nonmonotonic Reasoning
暂无分享,去创建一个
[1] Richard C. T. Lee,et al. Completeness Theorems for Semantic Resolution in Consequence-Finding , 1969, IJCAI.
[2] Raymond Reiter,et al. A Note on Linear Resolution Strategies in Consequence-Finding , 1972, Artif. Intell..
[3] Harry E. Pople,et al. Session 6 Theorem Proving and Logic: I I ON THE MECHANIZATION OF ABDUCTIVE LOGIC , 2006 .
[4] Robert L. Martin,et al. Knowledge and Justification. , 1976 .
[5] Sten-Åke Tärnlund,et al. Horn clause computability , 1977, BIT.
[6] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[7] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.
[8] J. McCarthy. First Order Theories of Individual Concepts and Propositions. , 1979 .
[9] Jon Doyle,et al. A Truth Maintenance System , 1979, Artif. Intell..
[10] Drew McDermott,et al. Non-Monotonic Logic I , 1987, Artif. Intell..
[11] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[12] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[13] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[14] Joseph Y. Halpern,et al. Towards a Theory of Knowledge and Ignorance: Preliminary Report , 1989, NMR.
[15] Dov M. Gabbay,et al. Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.
[16] Witold Lukaszewicz. Considerations on Default Logic , 1984, NMR.
[17] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[18] James A. Reggia,et al. A formal model of diagnostic inference. I. Problem formulation and decomposition , 1985, Inf. Sci..
[19] Pierre Siegel,et al. Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..
[20] Philip T. Cox,et al. Causes for Events: Their Computation and Applications , 1986, CADE.
[21] Nils J. Nilsson,et al. Probabilistic Logic * , 2022 .
[22] Yoav Shoham,et al. Nonmonotonic Logics: Meaning and Utility , 1987, IJCAI.
[23] John S. Schlipf,et al. Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..
[24] J. Finger,et al. Exploiting constraints in design synthesis , 1987 .
[25] David W. Etherington. Formalizing Nonmonotonic Reasoning Systems , 1987, Artif. Intell..
[26] Raymond Reiter,et al. Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.
[27] Dean Allemang,et al. Computational Complexity of Hypothesis Assembly , 1987, IJCAI.
[28] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[29] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[30] Michael Reinfrank,et al. A Non-Monotonic Deduction System Based on (A)TMS , 1988, ECAI.
[31] Michael Gelfond,et al. Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.
[32] Krzysztof R. Apt,et al. Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.
[33] John C. Shepherdson,et al. Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..
[34] David E. Smith,et al. Reasoning About Action II: The Qualification Problem , 1988, Artif. Intell..
[35] David Poole,et al. A Logical Framework for Default Reasoning , 1988, Artif. Intell..
[36] David Makinson,et al. General Theory of Cumulative Inference , 1988, NMR.
[37] Yoav Shoham,et al. Chronological Ignorance: Experiments in Nonmonotonic Temporal Reasoning , 1988, Artif. Intell..
[38] Jack Minker,et al. Perspectives in Deductive Databases , 1988, J. Log. Program..
[39] Paolo Mancarella,et al. Complete Logic Programs with Domain-Closure Axiom , 1988, J. Log. Program..
[40] Vladimir Lifschitz,et al. On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..
[41] David B. Kemp,et al. Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases , 1988, ICLP/SLP.
[42] Kenneth A. Ross,et al. Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.
[43] Teodor C. Przymusinski. Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming , 1989, KR.
[44] Ulrich Junker,et al. A Correct Non-Monotonic ATMS , 1989, IJCAI.
[45] Hector J. Levesque,et al. A Knowledge-Level Account of Abduction , 1989, IJCAI.
[46] Marianne Winslett,et al. Circumscribing Equality , 1989, IJCAI.
[47] John C. Shepherdson,et al. A Sound and Complete Semantics for a Version of Negation as Failure , 1989, Theor. Comput. Sci..
[48] Jack Minker,et al. A Stratification Semantics for General Disjunctive Programs , 1989, NACLP.
[49] Phan Minh Dung,et al. On the Generalized Predicate Completion of Non-Horn Programs , 1989, NACLP.
[50] Andrew B. Baker,et al. A Theorem Prover for Prioritized Circumscription , 1989, IJCAI.
[51] Brian C. Williams,et al. Diagnosis with Behavioral Modes , 1989, IJCAI.
[52] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..
[53] Jeffrey D. Ullman,et al. Bottom-up beats top-down for datalog , 1989, PODS '89.
[54] Mark Wallace,et al. A Computable Semantics for General Logic Programs , 1989, J. Log. Program..
[55] Vladimir Lifschitz,et al. Miracles in Formal Theories of Action , 1989, Artif. Intell..
[56] John W. Lloyd,et al. A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..
[57] Jorge Lobo,et al. Skeptical Reasoning and Disjunctive Programs , 1989, KR.
[58] David Poole,et al. A methodology for using a default and abductive reasoning system , 1989, Int. J. Intell. Syst..
[59] Solomon Eyal Shimony,et al. Probabilistic Semantics for Cost Based Abduction , 1990, AAAI.
[60] Teodor C. Przymusinski. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..
[61] Jorge Lobo,et al. Generalized Well-founded Semantics for Logic Programs (Extended Abstract) , 1990, CADE.
[62] Teodor C. Przymusinski,et al. On the relationship between CWA, minimal model, and minimal herbrand model semantics , 1990, Int. J. Intell. Syst..
[63] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[64] David S. Touretzky,et al. A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..
[65] Charles Elkan,et al. A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems , 1990, Artif. Intell..
[66] Taisuke Sato,et al. Completed Logic Programs and their Consistency , 1990, J. Log. Program..
[67] Vladimir Lifschitz,et al. On Open Defaults , 1990 .
[68] Katsumi Inoue,et al. On theorem provers for circumscription , 1990 .
[69] Sarit Kraus,et al. Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..
[70] M. Fitting,et al. Stratified, weak stratified and three-valued semantics , 1990 .
[71] Roland N. Bol,et al. Loop Checking and Negation , 1990, J. Log. Program..
[72] Teodor C. Przymusinski. Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..
[73] Jorge Lobo,et al. WF³: A Semantics for Negation in Normal Disjunctive Logic Programs , 1991, ISMIS.
[74] Melvin Fitting. Well-Founded Semantics, Generalized , 1991, ISLP.
[75] Carlo Zaniolo,et al. Partial Models and Three-Valued Models in Logic Programs with Negation , 1991, LPNMR.
[76] José Júlio Alferes,et al. Contradiction Removal within Well Founded Semantics , 1991, LPNMR.
[77] Bart Selman,et al. Hard Problems for Simple Default Logics , 1989, Artif. Intell..
[78] Gerhard Lakemeyer. All I Know About Tweety , 1991, Nonmonotonic and Inductive Logic.
[79] Jan A. Plaza. Completeness for Propositional Logic Programs with Negation , 1991, ISMIS.
[80] Katsumi Inoue,et al. Consequence-Finding Based on Ordered Linear Resolution , 1991, IJCAI.
[81] Michael Gelfond,et al. Strong Introspection , 1991, AAAI.
[82] Vladimir Lifschitz,et al. Nonmonotonic Databases and Epistemic Queries , 1991, IJCAI.
[83] Fahiem Bacchus,et al. Default Reasoning From Statistics , 1991, AAAI.
[84] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[85] Gerhard Brewka. Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules , 1991, Artif. Intell..
[86] Jürgen Dix. Default Theories of Poole-Type and a Method for constructing Cumulative Versions of Default Logic , 1992, ECAI.
[87] Serenella Cerrito,et al. A Linear Axiomatization of Negation as Failure , 1992, J. Log. Program..
[88] Jürgen Dix,et al. A Framework for Representing and Characterizing Semantics of Logic Programs , 1992, KR.
[89] Jürgen Dix,et al. Classifying Semantics of Disjunctive Logic Programs , 1992, JICSLP.
[90] Jürgen Dix,et al. The relationship between KLM and MAK models for nonmonotonic inference operations , 1992, J. Log. Lang. Inf..
[91] Georg Gottlob,et al. Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..