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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
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.