On the parameterized complexity of non-monotonic logics

[1]  Michael Elberfeld,et al.  On the Space Complexity of Parameterized Problems , 2012, IPEC.

[2]  Stefan Rümmele,et al.  The Parameterized Complexity of Abduction , 2012, AAAI.

[3]  Arne Meier,et al.  The Complexity of Reasoning for Fragments of Autoepistemic Logic , 2010, TOCL.

[4]  Arne Meier,et al.  The complexity of reasoning for fragments of default logic , 2008, J. Log. Comput..

[5]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic: Overview , 2012 .

[6]  Andreas Jakoby,et al.  Logspace Versions of the Theorems of Bodlaender and Courcelle , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[7]  Heribert Vollmer,et al.  Complexity of non-monotonic logics , 2010, Bull. EATCS.

[8]  Michael Thomas,et al.  Complexity of Propositional Abduction for Restricted Sets of Boolean Functions , 2009, KR.

[9]  Michael Thomas,et al.  On the complexity of fragments of nonmonotonic logics , 2010 .

[10]  S. Woltran,et al.  Answer-Set Programming with Bounded Treewidth , 2009, IJCAI.

[11]  Arne Meier,et al.  The complexity of propositional implication , 2008, Inf. Process. Lett..

[12]  Georg Gottlob,et al.  Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..

[13]  Miroslaw Truszczynski,et al.  Nonmonotonic Reasoning , 1988, We Will Show Them!.

[14]  Georg Gottlob,et al.  Bounded treewidth as a key to tractability of knowledge representation and reasoning , 2006, Artif. Intell..

[15]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[16]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[17]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[18]  Gustav Nordh,et al.  A Trichotomy in the Complexity of Propositional Circumscription , 2005, LPAR.

[19]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[20]  Yijia Chen,et al.  Bounded nondeterminism and alternation in parameterized complexity theory , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[21]  赵希顺,et al.  Fixed—Parameter Tractability of Disjunction—Free Default Reasoning , 2003 .

[22]  Phokion G. Kolaitis,et al.  The complexity of minimal satisfiability problems , 2001, Inf. Comput..

[23]  Georg Gottlob,et al.  Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..

[24]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[25]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[26]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[27]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[28]  G. Gottlob,et al.  Propositional circumscription and extended closed-world reasoning are ΠP2-complete , 1993 .

[29]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[30]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[31]  Ilkka Niemelä,et al.  Towards Automatic Autoepistemic Reasoning , 1991, JELIA.

[32]  Maurizio Lenzerini,et al.  The Complexity of Closed World Reasoning and Circumscription , 1990, AAAI.

[33]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[34]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[35]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[36]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[37]  Joseph Almog,et al.  Semantical considerations on modal counterfactual logic with corollaries on decidability, completeness, and consistency questions , 1980, Notre Dame J. Formal Log..

[38]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[39]  C. Peirce,et al.  Philosophical Writings of Peirce , 1955 .

[40]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[41]  C. Hartshorne,et al.  Collected Papers of Charles Sanders Peirce , 1935, Nature.

[42]  C. Peirce,et al.  Collected Papers of Charles Sanders Peirce. Vol. I, Principles of Philosophy , 1932 .