Backdoors into heterogeneous classes of SAT and CSP
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 t...
Main Authors: | Gaspers, S, Misra, N, Ordyniak, S, Szeider, S, Živný, S |
---|---|
Format: | Conference item |
Published: |
Association for the Advancement of Artificial
Intelligence
2014
|
Similar Items
-
Backdoors into heterogeneous classes of SAT and CSP
by: Gaspers, S, et al.
Published: (2016) -
Backdoors into heterogeneous classes of SAT and CSP
by: Gaspers, S, et al.
Published: (2016) -
SAT−Solving in CSP Trace Refinement
by: Palikareva, H, et al.
Published: (2012) -
SAT solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012) -
SAT-solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012)