Datalog with integer periodicity constraints

In this paper we introduce a generalization of Datalog that operates on periodicity constraints over integers. We develop a closed-form bottom-up evaluation procedure for this class of constraints. We also develop a closed-form bottom-up query evaluation procedure for the class of periodic constraints combined with gap-order constraints. We provide complexity bounds for the query evaluation procedures. We extend this approach to combinations of classes of constraints over disjoint domains in the framework of Datalog.