On computing logic programs
SourceJournal of Automated Reasoning
Google Scholar check
MetadataShow full item record
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.