Random SAT Instances à la Carte
暂无分享,去创建一个
[1] Michael E. Saks,et al. The Efficiency of Resolution and Davis--Putnam Procedures , 2002, SIAM J. Comput..
[2] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[3] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[4] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[5] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.
[6] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.
[7] Bart Selman,et al. Satisfiability testing: recent developments and challenge problems , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[8] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[9] Maria Luisa Bonet,et al. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) , 2022 .
[10] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[11] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[12] Bart Selman,et al. Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search , 2003, CP.
[13] Bart Selman,et al. Regular Random k-SAT: Properties of Balanced Formulas , 2005, Journal of Automated Reasoning.
[14] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[15] Bart Selman,et al. Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.