Post框架下命题溯因的复杂性分类
Complexity Classifications for Propositional Abduction in Post's Framework
摘要:
在本文中,我们调查的复杂性溯因,一个基本的和重要的形式的非单调推理。给定一个解释世界行为的知识库,它旨在为一些观察到的现象找到解释。在本文中,我们考虑命题溯因,其中的知识库和表现形式表示的命题公式。判定是否存在解释的问题一般被证明是\SigPtwo -完全的。我们专注于公式中,允许的连接词是从某些集合的布尔函数。我们认为不同的变种的绑架问题的限制的表现形式和假设。对于所有这些变体,我们得到了所有可能的布尔函数集的复杂性分类。通过这种方式,我们识别出了更简单的情况,即\NP -完全、\coNP -完全和多项式情况.因此,我们得到一个详细的图片的复杂性的命题溯因问题,从而突出的来源棘手。此外,我们解决的问题,计数的解释,并绘制一个完整的图片计数的复杂性。
英文摘要:
In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation. In this paper we consider propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation has been shown to be \SigPtwo-complete in general. We focus on formulae in which the allowed connectives are taken from certain sets of Boolean functions. We consider different variants of the abduction problem in restricting both the manifestations and the hypotheses. For all these variants we obtain a complexity classification for all possible sets of Boolean functions. In this way, we identify easier cases, namely \NP-complete, \coNP-complete and polynomial cases. Thus, we get a detailed picture of the complexity of the propositional abduction problem, hence highlighting sources of intractability. Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。