A study of przymusinski’s static semantics

Abstract

We represent Przymusinski’s Autoepistemic Logic of Beliefs and the associated static semantics in terms of a general formalism of biconsequence relations suggested in [3]. It is shown, in particular, that the static semantics belongs to a broad family of nonmonotonic formalisms constructed in accordance with a common completion schema. We consider also a formal representation for two important special cases covering, respectively, belief theories without nested modalities and theories serving as translations of general logic programs. The representation of the latter will allow us to clarify a place of the static semantics for logic programs in the general classification proposed in [5].