Prolog - Palindrome Functor

A palindrome list is a list which reads the same backwards, so you can reverse the list to check whether it yields the same list:

palindrome(L):-
  reverse(L, L).

Looks that everybody is voting for a reverse/2 based solution. I guess you guys have a reverse/2 solution in mind that is O(n) of the given list. Something with an accumulator:

 reverse(X,Y) :- reverse(X,[],Y).

 reverse([],X,X).
 reverse([X|Y],Z,T) :- reverse(Y,[X|Z],T).

But there are also other ways to check for a palindrome. I came up with a solution that makes use of DCG. One can use the following rules:

 palin --> [].
 palin --> [_].
 palin --> [Border], palin, [Border].

Which solution is better? Well lets do some little statistics via the profile command of the Prolog system. Here are the results:

So maybe the DCG solution is often faster in the positive case ("radar"), it does not have to build the whole reverse list, but directly moves to the middle and then checks the rest during leaving its own recursion. But disadvantage of DCG solution is that it is non-deterministic. Some time measurements would tell more...

Bye

P.S.: Port statistics done with new plugable debugger of Jekejeke Prolog:
http://www.jekejeke.ch/idatab/doclet/prod/en/docs/10_dev/10_docu/02_reference/04_examples/02_count.html

But other Prolog systems have similar facilities. For more info see, "Code Profiler" column:
http://en.wikipedia.org/wiki/Comparison_of_Prolog_implementations

This sure sounds like a homework question, but I just can't help myself:

palindrome(X) :- reverse(X,X).

Technically, prolog functor don't "return" anything.