Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Classical Methods in Nonmonotonic Reasoning


Dimopoulos,  Yannis
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Dimopoulos, Y. (1994). Classical Methods in Nonmonotonic Reasoning. In Z. Ras, & M. Zemankova (Eds.), Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems (ISMIS'94) (pp. 500-510). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AD65-8
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. It turns out that the graph model offers the possibility of the effective use of these problem solving approaches.