Classical methods in nonmonotonic reasoning
Source8th International Symposium on Methodologies for Intelligent Systems, ISMIS 1994
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 a general propositional logic program. In particular linear programming, propositional satisfiability, constraint satisfaction, and graph algorithms are considered. Central to our approach is the representation of a logic program by means of a graph. © Springer-Verlag Berlin Heidelberg 1994.