hide
Free keywords:
-
Abstract:
In this paper we present and compare some classical problem solving
methods for computing the stable models of logic programs with negation.
In particular linear programming, propositional satisfiability,
constraint satisfaction, and graph algorithms are considered. Central
to our approach is the representation of the logic program by means
of a graph.
