Andrei Bulatov’s contributions to the field of computer science were recognized as he was one of five researchers to receive the Gödel Prize for their work on the classification of the counting ...

Counting Constraint Satisfaction Problems (commonly referred to as #CSP) form a foundational framework in computational complexity theory by addressing the challenge of enumerating all possible ...

This topic sits at the nexus of combinatorial optimisation and computational complexity, offering insights into both algorithm design and the inherent difficulty of various problem classes.

We study the performance of stochastic local search algorithms for random instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search algorithm, ChainSAT, which moves in ...

1. AI: Constraint Satisfaction by IIT Madras: This free online course being offered by IIT Madras is a two credit course that gives participants an insight into general approaches to solving finite ...

Numerical constraint systems are often handled by branch and prune algorithms that combine splitting techniques, local consistencies, and interval methods. This paper first recalls the principles of ...