A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning
暂无分享,去创建一个
Hans Tompits | Torsten Schaub | Kewen Wang | James P. Delgrande | Torsten Schaub | J. Delgrande | H. Tompits | Kewen Wang
[1] Y. Shoham. Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .
[2] Hector Geffner,et al. Conditional Entailment: Bridging two Approaches to Default Reasoning , 1992, Artif. Intell..
[3] Gerald Pfeifer,et al. The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.
[4] Antonis C. Kakas,et al. Logic Programming without Negation as Failure , 1995, ILPS.
[5] Hans Tompits,et al. Considerations on Updates of Logic Programs , 2000, JELIA.
[6] Li-Yan Yuan,et al. Nonmonotonic Reasoning as Prioritized Argumentation , 2001, IEEE Trans. Knowl. Data Eng..
[7] Toshiko Wakaki,et al. Compiling Prioritized Circumscription into Extended Logic Programs , 1997, IJCAI.
[8] John F. Horty,et al. Some direct theories of nonmonotonic inheritance , 1994 .
[9] Francesco Buccafurri,et al. Stable Models and Their Computation for Logic Programming with Inheritance and True Negation , 1996, J. Log. Program..
[10] Hans Tompits,et al. On properties of update sequences based on causal rejection , 2001, Theory and Practice of Logic Programming.
[11] Chiaki Sakama,et al. Updating Extended Logic Programs through Abduction , 1999, LPNMR.
[12] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[13] José Júlio Alferes,et al. Dynamic Logic Programming , 1998, APPIA-GULP-PRODE.
[14] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..
[15] Torsten Schaub,et al. A General Approach to Specificity in Default Reasoning , 1994, KR.
[16] Norman Y. Foo,et al. Answer Sets for Prioritized Logic Programs , 1997, ILPS.
[17] Chiaki Sakama,et al. Abducing Priorities to Derive Intended Conclusions , 1999, IJCAI.
[18] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[19] Dirk Vermeir,et al. A Fixpoint Semantics for Ordered Logic , 1990, J. Log. Comput..
[20] Mark Ryan,et al. Representing Defaults as Sentences with Reduced Priority , 1992, KR.
[21] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[22] Gerald Pfeifer,et al. A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.
[23] Chiaki Sakama,et al. Representing Priorities in Logic Programs , 1996, JICSLP.
[24] Ann Q. Gates,et al. TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 2005 .
[25] Hans Tompits,et al. A framework for compiling preferences in logic programs , 2002, Theory and Practice of Logic Programming.
[26] Kurt Konolige,et al. Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning , 1988, AAAI.
[27] David Billington,et al. Propositional Plausible Logic: Introduction and Implementation , 2001, Stud Logica.
[28] John L. Pollock,et al. Defeasible Reasoning , 2020, Synthese Library.
[29] Torsten Schaub,et al. A Comparative Study of Logic Programs with Preference: Preliminary Report , 2001, Answer Set Programming.
[30] Thomas Eiter,et al. Prioritizing Default Logic , 2000, Intellectics and Computational Logic.
[31] Tran Cao Son,et al. Reasoning with Prioritized Defaults , 1997, LPKR.
[32] Theresa Swift,et al. Preference Logic Grammars: Fixed point semantics and application to data standardization , 2002, Artif. Intell..
[33] Raymond Reiter,et al. On Inheritance Hierarchies With Exceptions , 1983, AAAI.
[34] Vladimir Lifschitz,et al. Closed-World Databases and Circumscription , 1987, Artif. Intell..
[35] Yan Zhang,et al. Two results for prioritized logic programming , 2002, Theory and Practice of Logic Programming.
[36] Jussi Rintanen. Lexicographic Priorities in Default Logic , 1998, Artif. Intell..
[37] Yan Zhang,et al. Logic program-based updates , 2006, TOCL.
[38] Henry Prakken,et al. Logical Tools for Modelling Legal Argument , 1997 .
[39] Wolfgang Faber,et al. Computing preferred answer sets by meta-interpretation in answer set programming , 2003, Theory Pract. Log. Program..
[40] José Júlio Alferes,et al. Dynamic updates of non-monotonic knowledge bases , 2000, J. Log. Program..
[41] Wolfgang Faber,et al. Disjunctive Logic Programs with Inheritance , 1999, ICLP.
[42] Benjamin N. Grosof. Prioritized Conflict Handling for Logic Programs , 1997, ILPS.
[43] Franz Baader,et al. Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.
[44] Paolo Mancarella,et al. The Acceptability Semantics for Logic Programs , 1994, ICLP.
[45] David Billington,et al. Defeasible Logic is Stable , 1993, J. Log. Comput..
[46] Thomas Eiter,et al. Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..
[47] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[48] Fangzhen Lin,et al. Alternating Fixpoint Theory for Logic Programs with Priority , 2000, Computational Logic.
[49] Gerhard Brewka,et al. Adding Priorities and Specificity to Default Logic , 1994, JELIA.
[50] Norman Y. Foo,et al. Towards Generalized Rule-based Updates , 1997, IJCAI.
[51] Gerhard Brewka,et al. Logic programming with ordered disjunction , 2002, NMR.
[52] Chiaki Sakama,et al. Prioritized logic programming and its application to commonsense reasoning , 2000, Artif. Intell..
[53] Victor W. Marek,et al. Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.
[54] Jussi Rintanen. On Specificity in Default Logic , 1995, IJCAI.
[55] Jussi Rintanen. Prioritized Autoepistemic Logic , 1994, JELIA.
[56] Thomas F. Gordon,et al. Pleadings game - an artificial intelligence model of procedural justice , 1995 .
[57] Francesco Buccafurri,et al. Semantics and expressiveness of disjunctive ordered logic , 1999, Annals of Mathematics and Artificial Intelligence.
[58] Jack Minker,et al. Using Priorities to Combine Knowledge Bases , 1996, Int. J. Cooperative Inf. Syst..
[59] Torsten Schaub,et al. Preferredwell-foundedsemanticsfor logic programming by alternating fixpoints , 2002 .
[60] José Júlio Alferes,et al. Updates plus Preferences , 2000, JELIA.
[61] Torsten Schaub,et al. Expressing preferences in default logic , 2000, Artif. Intell..
[62] Jianhua Chen. Embedding Prioritized Circumscription in Logic Programs , 1997, ISMIS.
[63] Norman Y. Foo,et al. Updating Logic Programs , 1998, ECAI.
[64] Michael J. Maher,et al. Defeasible Logic versus Logic Programming without Negation as Failure , 2000, J. Log. Program..
[65] Torsten Schaub,et al. The role of default logic in knowledge representation , 2000 .
[66] Michael Gelfond,et al. Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.
[67] Henry Prakken,et al. Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.
[68] Raymond Reiter,et al. On Interacting Defaults , 1981, IJCAI.
[69] Jussi Rintanen. Complexity of Prioritized Default Logics , 1998, J. Artif. Intell. Res..
[70] Franz Baader,et al. How to Prefer More Specific Defaults in Terminological Default Logic , 1993, IJCAI.
[71] Torsten Schaub,et al. Compiling Reasoning with and about Preferences into Default Logic , 1997, IJCAI.
[72] Hans Tompits,et al. A Compilation of Brewka and Eiter's Approach to Prioritization , 2000, JELIA.
[73] Georg Gottlob,et al. The complexity of logic-based abduction , 1993, JACM.
[74] Donald Nute,et al. Defeasible Logic , 1994, INAP.
[75] David Makinson,et al. General patterns in nonmonotonic reasoning , 1994 .