What Is a Real-World SAT Instance?
暂无分享,去创建一个
Maria Luisa Bonet | Carlos Ansótegui | Jordi Levy | Felip Manyà | F. Manyà | C. Ansótegui | Jordi Levy
[1] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[2] Jacobo Torán,et al. Space Bounds for Resolution , 2001, Inf. Comput..
[3] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .
[4] Toniann Pitassi,et al. Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Joël Ouaknine,et al. Sudoku as a SAT Problem , 2006, ISAIM.
[6] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .
[7] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[8] A. N. Strahler. Hypsometric (area-altitude) analysis of erosional topography. , 1952 .
[9] Henry A. Kautz,et al. Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..
[10] Andrei P. Ershov. On programming of arithmetic operations , 1958, CACM.
[11] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[12] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[13] Eli Ben-Sasson,et al. Space complexity of random formulae in resolution , 2003, Random Struct. Algorithms.
[14] Lawrence J. Henschen,et al. Unit Refutations and Horn Sets , 1974, JACM.
[15] R. Horton. EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGY , 1945 .