On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances

de Haan, Ronald; Kanj, Iyad; Szeider, Stefan

doi:10.1145/3091528

by Ronald de Haan, Iyad Kanj, Stefan Szeider

Reference:

On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instancesRonald de Haan, Iyad Kanj, Stefan SzeiderACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.

Bibtex Entry:

@string{acmtcl="ACM Transactions on Computational Logic"}
@article {HaanKanjSzeider17,
    author = {de Haan, Ronald and Kanj, Iyad and Szeider, Stefan},
     title = {On the parameterized complexity of finding small unsatisfiable
              subsets of {CNF} formulas and {CSP} instances},
   journal = ACMTCL,
    volume = {18},
      year = {2017},
    number = {3},
     pages = {Art. 21, 46},
      issn = {1529-3785},
       doi       = {10.1145/3091528},
     pdf = {10.1145/3091528">https://doi.org/10.1145/3091528},
keywords={xtract},
}