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

MPI-I-93-226

On kernels, defaults and even graphs

Dimopoulos, Yannis and Magirou, Vangelis and Papadimitriou, Christos

MPI-I-93-226. June 1993, 11 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Extensions in prerequisite-free, disjunction-free default theories have been shown to be in direct correspondence with kernels of directed graphs; hence default theories without odd cycles always have a ``standard'' kind of an extension. We show that, although all ``standard'' extensions can be enumerated explicitly, several other problems remain intractable for such theories: Telling whether a non-standard extension exists, enumerating all extensions, and finding the minimal standard extension. We also present a new graph-theoretic algorithm, based on vertex feedback sets, for enumerating all extensions of a general prerequisite-free, disjunction-free default theory (possibly with odd cycles). The algorithm empirically performs well for quite large theories.
Acknowledgement:
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-93-226.pdfMPI-I-93-226.pdf4982 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: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-226
Hide details for BibTeXBibTeX
@TECHREPORT{Dimopoulos-93-mpii226,
  AUTHOR = {Dimopoulos, Yannis and Magirou, Vangelis and Papadimitriou, Christos},
  TITLE = {On kernels, defaults and even graphs},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-226},
  MONTH = {June},
  YEAR = {1993},
  ISSN = {0946-011X},
}