Finding Small Backdoors in SAT Instances
暂无分享,去创建一个
[1] Hans Kleine Büning,et al. Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008, SAT.
[2] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[3] Ashish Sabharwal,et al. Backdoors in the Context of Learning , 2009, SAT.
[4] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[5] Marko Samer,et al. Backdoor Trees , 2008, AAAI.
[6] Toby Walsh,et al. Backbones and Backdoors in Satisfiability , 2005, AAAI.
[7] Wolfgang Küchlin,et al. Formal methods for the validation of automotive product configuration data , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.
[8] Christian Bessière. Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.
[9] Thomas Stützle,et al. SATLIB: An Online Resource for Research on SAT , 2000 .
[10] Oliver Kullmann,et al. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.
[11] Maria Fox,et al. A New Empirical Study of Weak Backdoors , 2008, CP.
[12] Ashish Sabharwal,et al. Tradeoffs in the Complexity of Backdoor Detection , 2007, CP.
[13] Eric Horvitz,et al. The Backdoor Key: A Path to Understanding Problem Hardness , 2004, AAAI.
[14] Lakhdar Sais,et al. Computing Horn Strong Backdoor Sets Thanks to Local Search , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).
[15] Michael Kaufmann,et al. Computation of Renameable Horn Backdoors , 2008, SAT.