Systems of diophantine equations over finite configurations

Under study are the finite systems of Diophantine equations over finite configurations. We propose some consistency verification procedure for such a system and use the output of the procedure to constructing the complete solution set. We estimate the running time of the procedure in general and distinguish the class of systems for which the consistency problem is decidable in polynomial time.