Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)
arXiv:2609.32463
Abstract
We show that the constraint satisfaction problem of any finite conservative structure that can not pp-construct st-Con (whose CSP is NL-complete) or 3Lin2 (whose CSP is Mod2L-complete) is solved by a symmetric linear Datalog program and therefore in L.