DocumentCode
2745608
Title
Decision Problems in Autoepistemic Logic
Author
Gong, Wei ; Zhou, Jie
Author_Institution
Dept. of Electron. & Inf. Eng., Tianjin Inst. of Urban Constr., Tianjin, China
Volume
2
fYear
2010
fDate
5-6 June 2010
Firstpage
38
Lastpage
40
Abstract
In this paper we will prove the complexity of three main problems in the context of autoepistemic logic. The first problem is the question if a set of premise sum has a stable expansion. The second is if a given formula exists in at least one stable expansion, this problem is also known as brave reasoning. The third is if a given formula exists in every stable expansion, also known as cautious reasoning. we will explain the basics for these problems and induct you into the notation.
Keywords
computational complexity; formal logic; nonmonotonic reasoning; autoepistemic logic; brave reasoning; cautious reasoning; decision problems; Industrial engineering; Logic; autoepistemic; decision; expansion; reasoning;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Control and Industrial Engineering (CCIE), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-4026-9
Type
conf
DOI
10.1109/CCIE.2010.128
Filename
5491975
Link To Document