The follow is a continuation of the previous posting “Prolog using Examples – Part 4” Example 1: Check the prefix of a list. /* Base case */ /* When the list of prefix checked is empty means that we stop checking */ prefix([],_). /* Recursive case */ /* Both head of the list must be […]
In this part of this practical tutorial, we are going to do some coding involving facts, rules, recursion, and lists. Example 1: Obtain the head of the list, obtain the tail of the list. /* Get the head of the list */ get_head(Head, [Head|_]). /* Get the tail of the list */ get_tail(Tail, [_|Tail]). ?- […]
Prolog have a powerful way to work data by the use of lists. A list is normally a group of elements in each elements would have to pointers, one to the value and another to the next element or rest of the of the list. Just to clarify, we don’t see these pointers. A list […]
Lets begin with cases related with recursion: In an imperative style, you would use a loop to produce a result, while in an functional style, it is common to use recursion to produce the same result. The most common example related with recursion is the factorial recursion, in which for example the factorial of 6 […]
Prolog is a programming language which works around relations not functions. Prolog is homoiconic due the structure of its clauses and database that provide it the ability to represent itself. Note: A language is homoiconic when the language is self-defined. This means that if we run on the interpreter a copy of itself, it should […]