arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.00703cs.CCcs.LO
收藏

Schaefer框架中的参数化溯因复杂性

Parameterised Complexity of Abduction in Schaefer's Framework

Yasir Mahmood, Arne Meier, Johannes Schmidt

摘要:

溯因推理是一种非单调的形式主义,起源于皮尔士的工作。它描述了对已知事实进行最合理解释的过程。考虑到正的版本要求的变量集作为解释,我们研究,除了要求存在的一组解释,两个解释大小有限的变体这个推理问题(小于或等于,等于)。在本文中,我们提出了一个彻底的二维分类这些问题。第一个维度是关于大量不同参数化下的参数化复杂性。第二个维度在Schaefer的带有共克隆的约束满足框架(STOC 1978)中跨越了这些问题的所有可能的布尔片段。因此,我们几乎完成了Fellows等人(AAAI 2012)开始的参数化图片,部分建立在Nordh和Zanuttini(Artif.内特尔2008年)。在这个过程中,我们概述了这些问题的内在参数化棘手性的细粒度分析,并查明其FPT部分。由于标准的代数方法不适用于我们的问题,我们开发了一种替代方法,使代数工具部分可用。

英文摘要:

Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version asking for sets of variables as explanations, we study, besides asking for existence of the set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to). In this paper, we present a thorough two-dimensional classification of these problems. The first dimension is regarding the parameterised complexity under a wealth of different parameterisations. The second dimension spans through all possible Boolean fragments of these problems in Schaefer's constraint satisfaction framework with co-clones (STOC 1978). Thereby, we almost complete the parameterised picture started by Fellows et al. (AAAI 2012), partially building on results of Nordh and Zanuttini (Artif. Intell. 2008). In this process, we outline a fine-grained analysis of the inherent parameterised intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑