In: Dissertation, Universität Koblenz-Landau. 1993.
Abstract: The declarative semantics of logic programs and deductive databases have been investigated intensively during the past. However, still today there doesn't exist a standard semantics for both. The aim of this work is to introduce a Petri net semantics for logic programs and deductive databases which is more constructive than any known semantics today. The semantics of a logic program is defined by means of logical consequences of a set of (possibly 3-valued) models, which can be generated from the saturated marking of the programs's Petri net representation. According to their dynamical behaviour, the Petri nets which are suitable for modeling logic programs are called fixpoint nets.
Back to the Petri Nets Bibliography