On the relations between stable and well-founded semantics of logic programs
The paper investigates the relationship between the stable and well- founded semantics of logic programs with negation. It is shown that both semantics can be defined in similar ways. It is shown that both semantics are equivalent for several classes of programs.
scientific article; zbMATH DE number 96001
scientific article