Representability in Default Logic

Journal of the Interest Group in Pure and Applied Logic

A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.

 @article{libe-05-f,
 title = {Representability in Default Logic},
 year = {2005},
 author = {Liberatore, Paolo},
 journal = {Journal of the Interest Group in Pure and Applied Logic},
 pages = {335-351},
 number = {3},
 volume = {13},
 }