Reference Work Entry

Encyclopedia of Algorithms

pp 1-99

Parameterized SAT

2003; Szeider
  • Stefan SzeiderAffiliated withDepartment of Computer Science, Durham University

Keywords and Synonyms

Structural parameters for SAT       

Problem Definition

Much research has been devoted to finding classes of propositional formulas in conjunctive normal form (CNF) for which the recognition problem as well as the propositional satisfiability problem (SAT) can be decided in polynomial time. Some of these classes form infinite chains \( { C_1 \subset C_2 \subset \cdots } \) such that every CNF formula is contained in some Ck for k sufficiently large. Such classes are typically of the form \( { C_k=\{ F\in \text{CNF} \colon \pi(F) \leq k \} } \), where π is a computable mapping that assigns to CNF formulas F a non-negative integer \( { \pi(F) } \); we call such a mapping a satisfiability parameter. Since SAT is an NP-complete problem (actually, the first problem shown to be NP-complete [1]), we must expect that, the larger k, the longer the worst-case r ...

This is an excerpt from the content