Fixed-Parameter Tractable Reductions to SAT for Planning
暂无分享,去创建一个
[1] Jussi Rintanen,et al. Asymptotically Optimal Encodings of Conformant Planning in QBF , 2007, AAAI.
[2] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[3] Bart Selman,et al. Satisfiability Solvers , 2008, Handbook of Knowledge Representation.
[4] Stefan Szeider,et al. The Parameterized Complexity of Reasoning Problems Beyond NP , 2013, KR.
[5] Hector Geffner,et al. Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..
[6] Reinhard Pichler,et al. Parameterized Complexity of Optimal Planning: A Detailed Map , 2013, IJCAI.
[7] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[8] Carlos Gershenson,et al. Information and Computation , 2013, Handbook of Human Computation.
[9] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[10] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[11] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[12] Christian Borgelt,et al. Computational Intelligence , 2016, Texts in Computer Science.
[13] Stefan Szeider,et al. Backdoors to Normality for Disjunctive Logic Programs , 2013, AAAI.
[14] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[15] Michael R. Genesereth,et al. Logical foundations of artificial intelligence , 1987 .
[16] Sharad Malik,et al. Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.
[17] Jörg Flum,et al. Describing parameterized complexity classes , 2003, Inf. Comput..
[18] Stefan Szeider,et al. Fixed-Parameter Tractable Reductions to SAT , 2014, SAT.
[19] Vladimiro Sassone,et al. Bulletin of the European Association for Theoretical Computer Science , 2005 .
[20] Daniel Gooch,et al. Communications of the ACM , 2011, XRDS.
[21] Vladik Kreinovich,et al. Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.
[22] Stefan Szeider,et al. Parameterized Complexity Results for Agenda Safety in Judgment Aggregation , 2015, AAMAS.
[23] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[24] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[25] Joao Marques-Silva,et al. Anatomy and Empirical Evaluation of Modern SAT Solvers , 2011, Bull. EATCS.
[26] Stefan Rümmele,et al. Backdoors to Abduction , 2013, IJCAI.