2012/11/30 by Robert Cowen, Cowen, Robert
Computer Science · #Computability, Logic, AI Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms
paper · pdf · doi:10.48550/arxiv.1211.7152
openalex publication_date 2012/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.