{"type":"ScholarlyArticle","title":"Hidden Gold in Random Generation of SAT Satisfiable Instances","authors":[{"name":"Thierry Castell","slug":"thierry-castell","given":"Thierry","family":"Castell","affiliation":""},{"name":"Michel Cayrol","slug":"michel-cayrol","given":"Michel","family":"Cayrol","affiliation":""}],"abstract":"Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other generators of satisfiable instances generate instances that are not intrinsically hard, or exhaustive tests have not been done for determining hard and easy areas. A simple method for generating random hard satisfiable instances is presented. Instances are empirically shown to be hard for three classical methods : the \"Davis-~utnam\" procedure (which is complete), and the two mcomplete methods: GSA T and the Break Out Method. Moreover, a new method for escaping from local minima is presented.","doi":null,"url":"https://ijcai.org/proceedings/1997/55","pdf":"https://ijcai.org/proceedings/1997/0055.pdf","markdown":"https://ijcai.org/proceedings/1997/55.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/55","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":55,"pages":{"first":372,"last":376},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}