A Method for Constructing Minimally Unsatisfiable CNFs
  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. 
Robert Cowen
cs.LO math.LO