Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Classical methods in nonmonotonic reasoning

Dimopoulos, Yannis

MPI-I-94-229. 1994, 26 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Extended version of \cite{dim94a}
Categories / Keywords: logic programming, semantics, graph theory, algorithms
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-94-229.pdfMPI-I-94-229.pdf24533 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Dimopoulos, Yannis},
  TITLE = {Classical methods in nonmonotonic reasoning},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-229},
  YEAR = {1994},
  ISSN = {0946-011X},
  NOTE = {Extended version of \cite{dim94a}},