This paper describes a set of Prolog modules with predicates to access the information stored in the lexical database WordNet. The aim is to use the defined predicates for empowering (fuzzy) logic programming systems for approximate reasoning tasks. To achieve this goal it is necessary to have means to calculate the degree of relationship between the words. Because WordNet relates words but does not give graded information of the relation between those words, it is necessary to implement standard methods to compute that gradation.