MPI-INF/SWS Research Reports 1991-2021

2. Number - only D2


Classical methods in nonmonotonic reasoning

Dimopoulos, Yannis

1994, 26 pages.

Status: available - back from printing

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

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}},