Well-founded semantics for defeasible logic
暂无分享,去创建一个
[1] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[2] Michael J. Maher,et al. A Semantic Decomposition of Defeasible Logics , 1999, AAAI/IAAI.
[3] E. Sosa. Knowledge and justification , 1994 .
[4] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[5] Michael J. Maher,et al. A Family of Defeasible Reasoning Logics and its Implementation , 2000, ECAI.
[6] Robert L. Martin,et al. Knowledge and Justification. , 1976 .
[7] Michael J. Maher,et al. Efficient Defeasible Reasoning Systems , 2001, Int. J. Artif. Intell. Tools.
[8] Aldo Antonelli. Grounded consequence for defeasible logic , 2005 .
[9] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..
[10] David Makinson,et al. General patterns in nonmonotonic reasoning , 1994 .
[11] Martin Caminada. Well-Founded semantics for Semi-Normal Extended Logic Programs , 2006 .
[12] Henry Prakken,et al. Intuitions and the modelling of defeasible reasoning: some case studies , 2002, NMR.
[13] David Billington,et al. A modular translation from defeasible nets to defeasible logics , 1990, J. Exp. Theor. Artif. Intell..
[14] Michael J. Maher,et al. A Flexible Framework for Defeasible Logics , 2000, AAAI/IAAI.
[15] Michael J. Maher,et al. Argumentation Semantics for Defeasible Logic , 2004, J. Log. Comput..
[16] Donald Nute,et al. Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics , 2006, JELIA.
[17] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[18] Dov M. Gabbay,et al. Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.
[19] Grigoris Antoniou. Defeasible reasoning: A discussion of some intuitions , 2006, Int. J. Intell. Syst..
[20] Michael J. Maher,et al. Embedding defeasible logic into logic programming , 2006, Theory Pract. Log. Program..
[21] Karl Schlechta,et al. Floating Conclusions and Zombie Paths: Two Deep Difficulties in the "Directly Skeptical" Approach to Defeasible Inheritance Nets , 1991, Artif. Intell..
[22] John L. Pollock,et al. Defeasible Reasoning , 2020, Synthese Library.
[23] Torsten Schaub,et al. Preferredwell-foundedsemanticsfor logic programming by alternating fixpoints , 2002 .
[24] David Billington,et al. Defeasible Logic is Stable , 1993, J. Log. Comput..
[25] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[26] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[27] Krzysztof R. Apt,et al. Logics and Models of Concurrent Systems , 1989, NATO ASI Series.
[28] Donald Nute,et al. Defeasible Logic , 1994, INAP.
[29] Donald Nute,et al. Prolog Programming in Depth , 1988 .
[30] L. F. D. Cerro,et al. Intensional logics for programming , 1992 .
[31] Lynn Andrea Stein,et al. Resolving ambiguity in nonmonotonic reasoning , 1992 .
[32] David S. Touretzky,et al. A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..
[33] Michael J. Maher,et al. Representation results for defeasible logic , 2000, TOCL.
[34] Gerhard Brewka. On the Relationship between Defeasible Logic and Well-Founded Semantics , 2001, LPNMR.
[35] John F. Horty,et al. Skepticism and floating conclusions , 2002, Artif. Intell..