Computation of the semantics of autoepistemic belief theories

摘要

Recently, one of the authors introduced a simple and yet powerful non-monotonic knowledge representation framework, called the Autoepistemic Logic of Beliefs, AEB. Theories in AEB are called autoepistemic belief theories. Every belief theory T has been shown to have the least static expansionT which is computed by iterating a natural monotonic belief closure operator ΨT starting from T. This way, the least static expansion T of any belieftheory provides its natural non-monotonic semantics which is called the static semantics.