Abstract: A reasoning network is a special directed graph. Efficiently recognizing possible cycles in reasoning networks is useful not only in electronic networks and graph theory but also in automated knowledge acquisition research of intelligent systems. This paper designs a cycle recognition algorithm for reasoning networks and implements it in Turbo-PROLOG language. The algorithm can also be used for general directed graphs.