This is an implementation of the longest common prefix problem in Prolog. Longest common prefix for a pair of strings S1 and S2 is the longest string S which is the prefix of both S1 and S2. As an example, longest common prefix of "abcdefgh" and "abcefgh" is "abc".