Datalog with integer periodicity constraints

David Toman, Jan Chomicki
1998 The Journal of Logic Programming  
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
more » ... framework of Datalog. 0 1998 Elsevier Science Inc. All rights reserved. Algorithm 4 (Naive bottom-up evaluation). Let P be a DatalogEz program and I and J two variables over =-interpretations. I := 8; repeat J := I: I := TP,(Z) while J # I; return I
doi:10.1016/s0743-1066(97)10008-5 fatcat:trtzt7cef5c4nozjxpb25tpafi