English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Classical methods in nonmonotonic reasoning

MPS-Authors
/persons/resource/persons44325

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)

MPI-I-94-229.pdf
(Any fulltext), 24MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Dimopoulos, Y.(1994). Classical methods in nonmonotonic reasoning (MPI-I-94-229). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B7AF-6
Abstract
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.