%0 Journal Article
%T Characterization of an Auto-Compatible Default Theory
%A DaoYun Xu
%A DeCheng Ding
%A MingYi Zhang
%A <br>许道云
%A 丁德成
%A 张明义
%J 计算机科学技术学报
%D 2003
%I 
%X In this paper, an equivalence condition for deciding whether a default theory is an auto-compatible default one is presented. Under the condition, the existence of extension of an auto-compatible default theory is a natural result. By introducing a well-ordering over the set D of default rules, the extensions of an auto-compatible default theory (D, W) can be computed directly. The condition represents clearly the characterization of an auto-compatible default theory, and some properties about auto-compatible default theory, such as semi-monotonicity, become natural corollaries. Based on the characterization, the revision of default beliefs is discussed to ensure the existence of extension of the default theory, and the method is applied to investigate stable models of a general logic program.
%K auto-compatible default theory
%K logic program
%K stable model
%K extension<br>自动兼容违约理论
%K 逻辑程序
%K 稳定模型
%K 延伸
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=F115FD4F8028B2F63560E18A402098E3&yid=D43C4A19B2EE3C0A&vid=13553B2D12F347E8&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=5