The Correspondence between Horn Logic Programs and Formal Grammars
Horn逻辑程序和形式文法之间的对应关系

The paper researches Horn logic programs with grammatical view. The correspondence between Horn logic programs and grammars is found. The method by which type-0 grammars generate the least Herbrand models of logic programs is found. The method by which Horn logic programs generate the languages of type-0 grammars is found. The characterization of Horn Logic programs that are semantically equavanent to type-2 grammars and type-3 grammars is found.