A Method for Constructing Minimally Unsatisfiable CNFs
Robert Cowen
TL;DR
This paper generalizes a method for constructing unsatisfiable CNFs and demonstrates experimentally that most resulting CNFs are minimally unsatisfiable, contributing to the understanding of CNF satisfiability.
Contribution
It extends Ivor Spence's method for generating unsatisfiable CNFs and shows that the generated CNFs are mostly minimally unsatisfiable through experimental validation.
Findings
Most constructed CNFs are minimally unsatisfiable
The generalized method effectively produces minimally unsatisfiable CNFs
Experimental results support the method's effectiveness
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Machine Learning and Algorithms · Evolutionary Algorithms and Applications