Logic in Computer Science (LICS 1994)

Paper: A modal logic for subjective default reasoning (at LICS 1994)

Authors: Shai Ben-David Rachel Ben-Eliyahu

Abstract

Introduces a logic endowed with a two-place modal connective that has the intended meaning of “if α, then normally β”. On top of providing a well defined tool for analyzing common default reasoning, such a logic allows nesting of the default operator. We present a semantic framework in which many of the known default proof systems can be naturally characterized, and prove soundness and completeness theorems for several such proof systems. Our semantics is a “neighborhood modal semantics”, and it allows for subjective defaults, i.e. defaults may vary within different worlds that belong to the same model. The semantics has an appealing intuitive interpretation and may be viewed as a set theoretic generalization of the probabilistic interpretations of default reasoning. We show that our semantics is general in the sense that any modal semantics that is sound for some basic axioms for default reasoning is a special case of our semantics. Such a generality result may serve to provide a semantical analysis of the relative strengths of different proof systems and to show the nonexistence of semantics with certain properties

BibTeX

  @InProceedings{BenDavidBenEliyahu-Amodallogicforsubje,
    author = 	 {Shai Ben-David and Rachel Ben-Eliyahu},
    title = 	 {A modal logic for subjective default reasoning},
    booktitle =  {Proceedings of the Ninth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1994},
    year =	 1994,
    editor =	 {Samson Abramsky},
    month =	 {July}, 
    pages =      {477--486},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }