Document Open Access Logo

Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities

Author Oliver Kullmann



PDF
Thumbnail PDF

File

DagSemProc.06401.4.pdf
  • Filesize: 0.68 MB
  • 70 pages

Document Identifiers

Author Details

Oliver Kullmann

Cite AsGet BibTex

Oliver Kullmann. Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. In Complexity of Constraints. Dagstuhl Seminar Proceedings, Volume 6401, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06401.4

Abstract

Generalised CNFs are considered using such literals, which exclude exactly one possible value from the domain of the variable. First we consider poly-time SAT decision (and fixed-parameter tractability) exploiting matching theory. Then we consider irredundant generalised CNFs, and characterise some extremal minimally unsatisfiable CNFs.
Keywords
  • Signed CNF
  • autarkies
  • minimal unsatisfiable
  • hypergraph colouring
  • block designs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail