On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
暂无分享,去创建一个
[1] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[2] Hector J. Levesque,et al. Hard problems for simple default logics , 1992 .
[3] Ilkka Niemelä,et al. Towards Automatic Autoepistemic Reasoning , 1991, JELIA.
[4] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[5] Victor W. Marek,et al. Relating Autoepistemic and Default Logics , 1989, KR.
[6] Georg Gottlob. The Complexity of Default Reasoning under the Stationary Fixed Point Semantics , 1995, Inf. Comput..
[7] Marco Schaerf,et al. A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..
[8] Georg Gottlob,et al. Translating default logic into standard autoepistemic logic , 1995, JACM.
[9] Chiaki Sakama,et al. Relating Disjunctive Logic Programs to Default Theories , 1993, LPNMR.
[10] Georg Gottlob,et al. Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..
[11] Victor W. Marek,et al. Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.
[12] Joseph Y. Halpern,et al. Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.
[13] Christos H. Papadimitriou,et al. On Finding Extensions of Default Theories , 1992, ICDT.
[14] Jonathan Stillman,et al. The Complexity of Propositional Default Logics , 1992, AAAI.
[15] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..
[16] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.
[17] Tomi Janhunen. On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription , 1998, JELIA.
[18] Jonathan Stillman,et al. It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics , 1990, AAAI.
[19] Bart Selman,et al. The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.