On the maximal minimal cube lengths in distinct DNF tautologies
DISCRETE MATHEMATICS LETTERS(2019)
摘要
Inspired by a recent article by Zaleski and Zeilberger [arXiv:1801.05097 Imath.CO]; Math. Mag., To appear], we investigate the question of determining the largest k for which there exist Boolean formulas in disjunctive normal form (DNF) with n variables, which are tautologies, whose conjunctions have distinct sets of variables, and such that all the conjunctions have at least k literals. Using a SAT solver, we answer the question for some sizes which Zaleski and Zeilberger left open. We also determine the corresponding numbers for DNFs obeying certain symmetries.
更多查看译文
关键词
covering systems, SAT solving, symmetry breaking
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络