The cyclic scheduling problem is known to be NP-Complete and thus coding a procedure to solve it is difficult and error-prone. This is particularly dangerous for hard real-time systems since they have critical timing requirements. It is necessary a formal strategy to abstract unnecessary details and assure correctness. Furthermore, time-to-market for this kind of systems is continuously decreasing, demanding development processes even more agile. This work proposes a declarative strategy where the user keeps the focus on what is to be computed and not how to implement it. This strategy consists in formally declaring the properties of the system with multiple processors using first-order logics. All the job of finding a feasible schedule is done by Prolog inference engine which carries the scheduling process out. Thus the lack of formality and agility is overcome. In spite of simplicity, this solution is very powerful and expressive.