License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-8030
URL: http://drops.dagstuhl.de/opus/volltexte/2006/803/

Kullmann, Oliver

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

pdf-format:
Dokument 1.pdf (703 KB)


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.

BibTeX - Entry

@InProceedings{kullmann:DSP:2006:803,
  author =	{Oliver Kullmann},
  title =	{Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities},
  booktitle =	{Complexity of Constraints},
  year =	{2006},
  editor =	{Nadia Creignou and Phokion Kolaitis and Heribert Vollmer},
  number =	{06401},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/803},
  annote =	{Keywords: Signed CNF, autarkies, minimal unsatisfiable, hypergraph colouring, block designs}
}

Keywords: Signed CNF, autarkies, minimal unsatisfiable, hypergraph colouring, block designs
Seminar: 06401 - Complexity of Constraints
Issue date: 2006
Date of publication: 15.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI