Simpler consistency procedures for finite-on-top-of-temporal CSPs

Determine whether a simpler and less expensive consistency procedure than the sampling-based extension of constraint-singleton arc consistency suffices to decide the positive finite-on-top-of-temporal CSPs considered in the paper.

Background

The positive classification is established using an algorithm that first samples a finite substructure of the temporal template and then applies nested consistency tests, including an outer test over constraint pairs. This procedure is relatively expensive. The authors explicitly state that they do not know whether a simpler consistency method would suffice, although their current proof strategy depends on the stronger procedure.