Classical methods in nonmonotonic reasoning
Ημερομηνία
1994ISSN
0302-9743Source
8th International Symposium on Methodologies for Intelligent Systems, ISMIS 1994Volume
869 LNAIPages
500-510Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
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.