Small unsatisfiable k-CNFs with bounded literal occurrence

Zhang, Tianwei; Peitl, Tomáš; Szeider, Stefan

doi:10.4230/LIPIcs.SAT.2024.31

by Tianwei Zhang, Tomáš Peitl, Stefan Szeider

Reference:

Small unsatisfiable k-CNFs with bounded literal occurrenceTianwei Zhang, Tomáš Peitl, Stefan Szeider27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Bibtex Entry:

@InProceedings{ZhangPeitlSzeider24,
  author       = {Tianwei Zhang  and Tom{\'{a}}\v{s} Peitl and Stefan Szeider},
  title        = {Small unsatisfiable k-CNFs with bounded literal occurrence},
booktitle =	{27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)},
  pages =	{31:1--31:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-334-8},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{305},
  editor =	{Chakraborty, Supratik and Jiang, Jie-Hong Roland},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
    doi =		{10.4230/LIPIcs.SAT.2024.31},
   keywords  = {strides},
}