On computing logic programs
Date
1996Source
Journal of Automated ReasoningVolume
17Issue
3Pages
259-289Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
In this paper we present and compare some classical problem-solving methods for computing the stable models of logic programs with negation. Using a graph theoretic representation of logic programs and their stable models, we discuss and compare linear programming, propositional satisfiability, constraint satisfaction, and graph methods. © 1996 Kluwer Academic Publishers.