4 papers
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…
Symmetric Linear Arc Monadic Datalog and Gadget Reductions
Manuel Bodirsky, Florian Starke
A Datalog program solves a constraint satisfaction problem (CSP) if and only if it derives the goal predicate precisely on the unsatisfiable instances of the CSP. There are three D…
Finite Simple Groups in the Primitive Positive Constructability Poset
Sebastian Meyer, Florian Starke
We show that any clone over a finite domain that has a quasi Maltsev operation and fully symmetric operations of all arities has an incoming minion homomorphism from I, the clone o…
Digraphs modulo primitive positive constructability
Florian Starke
This is my dissertation about digraphs ordered by pp-constructability. We study in particular smooth digraphs, i.e., digraphs without sources or sinks, tournaments and semicomplete…