In: Fachberichte Informatik, Universität Koblenz-Landau. 1991.
Abstract: In this paper, we want to give a formal definition of Datalog nets and their semantics. We restrict the scope of the paper to Horn clause programs with limited variables without function symbols. We will prove that the net semantics equals the least Herbrand model semantics.