Backdoors to Satisfaction

@inproceedings{Gaspers2012BackdoorsTS,
  title={Backdoors to Satisfaction},
  author={Serge Gaspers and Stefan Szeider},
  booktitle={The Multivariate Algorithmic Revolution and Beyond},
  year={2012}
}
  • Serge Gaspers, Stefan Szeider
  • Published in
    The Multivariate Algorithmic…
    2012
  • Computer Science, Mathematics
  • A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can reduce the question of whether the given formula is satisfiable to the same question for one or several easy formulas that belong to the tractable class under consideration. In this survey we review parameterized complexity results for problems that arise in the… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 73 CITATIONS, ESTIMATED 94% COVERAGE

    Backdoor Treewidth for SAT

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Backdoor Sets for CSP

    Backdoors to Acyclic SAT

    Backdoors to Tractable Answer-Set Programming

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    Backdoors to Tractable Valued CSP

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Backdoors for Linear Temporal Logic

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Backdoors for Linear Temporal Logic

    VIEW 11 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Strong Backdoors to Nested Satisfiability

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Strong Backdoors to Bounded Treewidth SAT

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Upper and Lower Bounds for Weak Backdoor Set Detection

    VIEW 5 EXCERPTS
    CITES BACKGROUND & RESULTS

    FILTER CITATIONS BY YEAR

    2011
    2020

    CITATION STATISTICS

    • 8 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 146 REFERENCES

    Matched Formulas and Backdoor Sets

    • Stefan Szeider
    • Computer Science, Mathematics
    • J. Satisf. Boolean Model. Comput.
    • 2007
    VIEW 1 EXCERPT

    Backdoors to Acyclic SAT

    VIEW 14 EXCERPTS

    Backdoor Sets for DLL Subsolvers

    • Stefan Szeider
    • Mathematics, Computer Science
    • Journal of Automated Reasoning
    • 2005
    VIEW 4 EXCERPTS

    Backdoors to Tractable Answer-Set Programming

    VIEW 3 EXCERPTS

    Backdoor Trees

    VIEW 2 EXCERPTS

    Finding Small Backdoors in SAT Instances

    VIEW 1 EXCERPT

    Strong Backdoors to Bounded Treewidth SAT

    Backdoor Sets of Quantified Boolean Formulas

    VIEW 1 EXCERPT