← Search

Daniil Chivilikhin

2 accepted papers

2023

Probabilistic Generalization of Backdoor Trees with Application to SAT

AAAI 2023technical

The concept of Strong Backdoor Sets (SBS) for Constraint Satisfaction Problems is well known as one of the attempts to exploit structural peculiarities in hard instances. However, in practice, finding an SBS for a particular instance is often harder than solving it. Recently, a probabilistic weakene…

2022

On Probabilistic Generalization of Backdoors in Boolean Satisfiability

AAAI 2022technical

The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set (SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean variables B a ρ-backdoor, if for a fraction of at least ρ of possible assignments of variables from B, assigning their v…