CSPs solvable by slam Datalog are exactly those admitting a gadget reduction to a Boolean CSP, equivalently characterized by unfolded caterpillar duality and the existence of quasi Maltsev and k-absorptive operations, implying decidability of expressibility.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Universal algebra supplies cyclic terms and bounded-width conditions that classify the tractability of finite-domain CSPs via graph homomorphisms.
citing papers explorer
-
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
CSPs solvable by slam Datalog are exactly those admitting a gadget reduction to a Boolean CSP, equivalently characterized by unfolded caterpillar duality and the existence of quasi Maltsev and k-absorptive operations, implying decidability of expressibility.
-
Graph Homomorphisms and Universal Algebra
Universal algebra supplies cyclic terms and bounded-width conditions that classify the tractability of finite-domain CSPs via graph homomorphisms.