The computational treatment of lexical rules proposed can be seen as an extension to the principled method discussed by Gotz and Meurers ( 1995 , 1996 , 1997b ) for encoding the main building block of HPSG grammars -- the implicative constraints -- as a logic program .