Computation of the semantics of autoepistemic belief theories

被引：0
|
作者：
Brass, Stefan [1 ]
Jürgen, Dix [2 ]
Przymusinski, Teodor C. [3 ]
机构：
[1] School of Information Sciences, University of Pittsburgh, Pittsburgh, PA 15260, United States
[2] Department of Computer Science, University of Maryland, A.V. Williams Build, College Park, MD 20752-3255, United States
[3] Department of Computer Science, University of California, Riverside, CA 92521, United States
来源：
Artificial Intelligence | 1999年 / 112卷 / 01期
基金：
美国国家科学基金会;
关键词：
Computational linguistics - Database systems - Formal logic - Iterative methods - Theorem proving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Autoepistemic logic of beliefs, AEB, is a non-monotomic knowledge representation framework. Theories in AEB are called autoepistemic belief theories. Every belief theory T is shown to have at least static expansion T¯ which is computed by iterating a natural monotonic belief closure operator ΨT starting from T. This way, the least static expansion T¯ of any belief theory provides its natural non-monotonic semantics which is called the static semantics.
引用
收藏
页码：233 / 250
相关论文
共 50 条
12345