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 ...

Constraint programming combined with machine learning provides a robust framework for addressing complex combinatorial problems across diverse domains such as energy management, production scheduling ...

constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs can be used to solve problems such as graph-coloring: ...

My research is concerned with developing Constraint Programming methodology for Intelligent Systems applications. The methodology includes constraint solving algorithms, systematic and heuristic ...