2 papers
cs.LO2026
Automatic constraint satisfaction problem
Andrei Bulatov, Xiaoyang Gong, Bakh Khoussainov +1
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of…
cs.CC2025
Discrete Homotopy and Promise Constraint Satisfaction Problem
Arash Beikmohammadi, Andrei A. Bulatov
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic p…