Translating default logic into standard autoepistemic logic

Author:

Gottlob Georg1

Affiliation:

1. Technische Univ. Wien, Vienna, Austria

Abstract

Since Konolige's translation of default logic into strongly grounded autoepistemic logic, several other variants of Moore's original autoepistemic logic that embody default logic have been studied. All these logics differ significantly from Moore's autoepistemic logic (standard AEL) in that expansions are subject to additional groundedness-conditions. Hence, the question naturally arises whether default logic can be translated into standard AEL at all. We show that a modular translation is not possible. However, we are able to construct a faithful polynomial-time translation from default logic into standard AEL, which is nonmodular. Our translation exploits the self-referentiality of AEL. It uses as an important intermediate step an embedding of Marek's and Truszczyn´ski's nonmonotonic logic N into standard AEL. It follows from our results that the expressive power of standard AEL is strictly greater than that of default logic.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference34 articles.

1. ~BESNARD PH. 1989. Default Logic. Springer-Verlag Berlin Heidelberg New York (Symbolic ~Computation Series).]] ~BESNARD PH. 1989. Default Logic. Springer-Verlag Berlin Heidelberg New York (Symbolic ~Computation Series).]]

2. ~CADOLI M. AND SCHAERF M. 1993. A survey of complexity results for non-monotonic logics. J. ~Logic Prog. 17 127-160.]] ~CADOLI M. AND SCHAERF M. 1993. A survey of complexity results for non-monotonic logics. J. ~Logic Prog. 17 127-160.]]

3. ~EITER TH. AND GOTTLOB G. 1992. Reasoning with parsimonious and moderately grounded ~expansions. Fund. llzf. 17 31-53 ]] ~EITER TH. AND GOTTLOB G. 1992. Reasoning with parsimonious and moderately grounded ~expansions. Fund. llzf. 17 31-53 ]]

4. ~FITTING M. C. MAREK W. AND TRUSZCZYIqSKI M. 1992. The pure logic of necessitation. J. ~Logtc and Comput. 2 3 349-373.]] ~FITTING M. C. MAREK W. AND TRUSZCZYIqSKI M. 1992. The pure logic of necessitation. J. ~Logtc and Comput. 2 3 349-373.]]

Cited by 38 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Strong Backdoors for Default Logic;ACM Transactions on Computational Logic;2024-06-17

2. On the Equivalence between Assumption-Based Argumentation and Logic Programming;Journal of Artificial Intelligence Research;2017-12-14

3. Comparing the expressiveness of argumentation semantics;Journal of Logic and Computation;2016-04-12

4. Grounded fixpoints and their applications in knowledge representation;Artificial Intelligence;2015-07

5. Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics;Artificial Intelligence and Soft Computing;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3