D
2014
Backdoors into Heterogeneous Classes of SAT and CSP
GASPERS, Serge, Sebastian ORDYNIAK, Stefan SZEIDER, Neelhara MISRA, Stanislav ZIVNY et. al.
Basic information
Original name
Backdoors into Heterogeneous Classes of SAT and CSP
Authors
GASPERS, Serge (442 Luxembourg), Sebastian ORDYNIAK (276 Germany, guarantor, belonging to the institution), Stefan SZEIDER (40 Austria), Neelhara MISRA (356 India) and Stanislav ZIVNY (203 Czech Republic)
Edition
Quebec, AAAI Press, p. 2652-2658, 7 pp. 2014
Other information
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
printed version "print"
RIV identification code
RIV/00216224:14330/14:00077721
Organization unit
Faculty of Informatics
Keywords in English
parameterized complexity;satisfiability; constraint satisfaction; strong backdoor; polymorphism
Tags
International impact, Reviewed
V originále
Backdoor sets represent clever reasoning shortcuts through the search space for SAT and CSP. By instantiating the backdoor variables one reduces the given instance to several easy instances that belong to a tractable class.The overall time needed to solve the instance is exponential in the size of the backdoor set, hence it is a challenging problem to find a small backdoor set if one exists; over the last years this problem has been subject of intensive research. In this paper we extend the classical notion of a strong backdoor set by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong backdoor sets into heterogeneous base classes for SAT and CSP. We provide algorithms that establish fixed-parameter tractability under natural parameterizations, and we contrast the tractability results with hardness results that pinpoint the theoretical limits. Our results apply to the current state-of-the-art of tractable classes of CSP and SAT that are definable by restricting the constraint language.
Links
EE2.3.30.0009, research and development project | Name: Zaměstnáním čerstvých absolventů doktorského studia k vědecké excelenci |
|
Displayed: 20/10/2024 19:33