We characterize obstruction sets in caterpillar dualities in terms of regular languages and give a construction of the dual of a regular family of caterpillars. In particular, we prove that every monadic linear Datalog program with at most one extensional database per rule defines the complement of a contraint satisfaction problem.
- Caterpillar duality
- Constraint satisfaction problems
- Regular languages
ASJC Scopus subject areas