l]eP HO+)CUds|tv8"*=^ l>bڎi;Kx?'~A9¨f~,h=s`ǍlÁ/vךy,S WBA1Ͱ֣CY4]փm2hZ%u/aܮ,+ R6]ĭr-F=*|2-K4>1!Ŧ*}S8{i+Lxxvthc̀[ (H>ʺ|t9JN tPnZvOMz&isQۙM6kj)՚xHt$f0 )|$efficient (in the sense of producing fewer and/or shorter clauses) the translation procedure is. We present a normal form for normal modal logics and the use of anti-prenexing technique in order to minimise the set of clauses. We compare our procedure to a more traditional approach and discuss how optimisations, for specific normal logics, help us to produce better sets of clauses.