One pivot puzzles can be solved with a variety of computer languages -- including prolog, java, c even -- but once you get beyond one-pivot puzzles, you need a language with constraint logic programming (finite domain) capability.

Five men with different nationalities live in the first five houses of a street. They practise five distinct professions, and each of them has a favourite animal and a favourite drink, all of them different. The five houses are painted in different colours.

The Englishman lives in the red house. English = Red, where English is a number between 1 and 5. Whatever number English is, it is the same number as Red
The Spaniard owns a dog.
The Japanese is a painter.
The Italian drinks tea.
The Norwegian lives in the first house on the left. Norwegian = 1
The owner of the green house drinks coffee.
The green house is on the right of the white one. To the right is a higher number. Green > White
The sculptor breeds snails.
The diplomat lives in the yellow house.
Milk is drunk in the middle house. Milk = 3
The Norwegian's house is next to the blue one. Norwegian is either Blue + 1 or Blue - 1
The violinist drinks fruit juice.
The fox is in a house next to that of the doctor.
The horse is in a house next to that of the diplomat.

Q. Who owns a Zebra, and who drinks water?

(They sometimes smoke different brands of cigarettes too, but that's apparently no longer politically correct, so they all quit.)
Solutions to this puzzle are given in the ECLiPSe documentation.