]> 2012-02-11T02:27:29-05:00 Experimental results on the satisfiable core in random 3sat Given a satisfiable k-CNF SAT instance, a satisfiable core isa minimal subset of the k-CNF clauses that preserves all and onlythe satisfying assignments of the original instance. In this paper,we extend the previous results on satisfiable core, especially onthe strong correlation between the hardness of SAT instances and thesize of their satisfiable cores. We introduce a measure called theweighted clause-to-variable ratio, which substantially improves onthe classic clause-to-variable ratio in explaining the phasetransition. We also examine interesting transitions in satisfiablecore size of random instances and show that satisfiable core is apowerful concept for studying the constrainedness of instances. inproceedings Ninth International Symposium on Artificial Intelligence and Mathematics KSL-06-01 Experimental Results on the Satisfiable Core in Random 3SAT KSL-06-01 2006 Year Tr id Title Computer science Tag January Month Key Booktitle Bibtype Sheila A. McIlraith Honglei Zeng Author Fort Lauderdale, Florida, USA Address Abstract KSL Technical Report Publication Proceeding Paper