Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments

We introduce $n$-almost symmetric Datalog and study $n$-almost symmetric linear arc monadic Datalog.

We characterize the finite relational structures whose constraint satisfaction problem is solved by this Datalog fragment as those that can be primitive positively constructed from the transitive tournament on $n+2$ vertices.

We also give characterizations in terms of a certain homomorphism duality (which we call $n$-fixed unfolded caterpillar duality) and in universal-algebraic terms (the existence of $k$-absorptive operations and of operations forming an elevator chain of length $n+1$).

This article generalizes the results from Bodirsky and Starke about symmetric linear arc monadic Datalog.