Paper: Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning (at LICS 1995)

Authors: Victor W. Marek Anil Nerode Jeffrey B. Remmel

Abstract

Normal default logic, the fragment of default logic obtained by restricting defaults to rules of the form a:Mb/b (here a and b are sentences of underlying language) is the most important and widely studied part of default logic. In an earlier paper we proved a basis theorem for extensions of recursive propositional logic normal default theories and hence for finite predicate logic normal default theories. That is, we proved that every recursive propositional normal default theory possesses an extension which is r.e. in 0'. Here we show that this bound is tight. Specifically, we show that for every r.e. set A and every set B r.e. in A there is a recursive normal default theory (D,W) with a unique extension which is Turing-equivalent to A+B (here + is the operation of disjoint union of sets) . A similar result holds for finite predicate logic normal default theories.}

BibTeX

  @InProceedings{MarekNerodeRemmel-ComplexityofNormalD,
    author = 	 {Victor W. Marek and Anil Nerode and Jeffrey B. Remmel},
    title = 	 {Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning},
    booktitle =  {Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science (LICS 1995)},
    year =	 {1995},
    month =	 {June}, 
    pages =      {178--185},
    location =   {San Diego, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }