The Complexity of Reasoning for Fragments of Autoepistemic Logic
The Complexity of Reasoning for Fragments of Autoepistemic Logic
复制标题
自我认知逻辑片段推理的复杂性
DOI:
10.1145/2159531.2159539
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
H. Vollmer
中科院分区:
文献类型:
--
作者:
N. Creignou;A. Meier;M. Thomas;H. Vollmer
Autoepistemic logic extends propositional logic by the modal operatorL. A formulaφthat is preceded by anLis said to be “believed.” The logic was introduced by Moore in 1985 for modeling an ideally rational agent’s behavior and reasoning about his own beliefs. In this article we analyze all Boolean fragments of autoepistemic logic with respect to the computational complexity of the three most common decision problems expansion existence, brave reasoning and cautious reasoning. As a second contribution we classify the computational complexity of checking that a given set of formulae characterizes a stable expansion and that of counting the number of stable expansions of a given knowledge base. We improve the best knownΔ2p-upper bound on the former problem to completeness for the second level of the Boolean hierarchy. To the best of our knowledge, this is the first paper analyzing counting problem for autoepistemic logic.
登录
查看更多内容
DOI:
10.1142/s0129054110007258
发表时间:
2010
期刊:
Int. J. Found. Comput. Sci.
影响因子:
--
作者:
Henning Schnoor
通讯作者:
Henning Schnoor
影响因子:
0.5
作者:
Michael Thomas
通讯作者:
Michael Thomas
DOI:
10.1016/s0020-0190(00)00091-0
发表时间:
2000
期刊:
Inf. Process. Lett.
影响因子:
--
作者:
U. Hertrampf;S. Reith;H. Vollmer
通讯作者:
H. Vollmer
DOI:
10.1007/bf01744287
发表时间:
1979
期刊:
Mathematical systems theory
影响因子:
--
作者:
H. R. Lewis
通讯作者:
H. R. Lewis
DOI:
10.1007/bfb0020812
发表时间:
1991
期刊:
Artif. Intell.
影响因子:
--
作者:
G. Buntrock;C. Damm;U. Hertrampf;C. Meinel
通讯作者:
C. Meinel