6 citations · 15 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.RA2026
Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)
Florian Starke
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-compl…
cs.LO2026
Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments
Sebastian Meyer, Florian Starke
We introduce -almost symmetric Datalog and study -almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction…