A Method for Constructing Minimally Unsatisfiable CNFs
Robert H. Cowen · arXiv (Cornell University) · 2012
We generalize a method of Ivor Spence (J. of Experimental Algorithms 15(March 2010)) that produces unsatisfiable cnfs and show experimentally that, for the most part, the resulting cnfs are minimally unsatisfiable.