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

从判定DNNF电路中枚举素蕴涵的复杂性

On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits

Univ. Artois(阿尔图瓦大学);CNRS(法国国家科学研究中心);Centre de Recherche en Informatique de Lens (CRIL)(朗斯计算机研究中心);Institut Universitaire de France(法国大学研究院)

Alexis de Colnet, Pierre Marquis

摘要:

本文研究了由判定可分解否定范式(dec-DNNF)电路表示的布尔函数的素蕴涵的枚举问题EnumIP。我们研究枚举复杂性的框架内从dec-DNNF EnumIP,并证明它是在OutputP,类的输出多项式枚举问题,更准确地说,在IncP,类的多项式增量时间枚举问题。然后,我们专注于两个密切相关的,但似乎更难,枚举问题的进一步限制,把素蕴涵产生。在第一个问题中,人们只对代表子集最小溯因解释的素蕴涵感兴趣,这是一个在人工智能中研究了三十多年的概念。在第二个问题中,目标是代表充分理由的主蕴涵,这是新兴的可解释人工智能领域中的一个最近但重要的概念,因为它们旨在解释机器学习分类器实现的预测。我们提供的证据表明,枚举特定的素蕴涵对应子集最小溯因解释或充分的理由是不是在输出P。

英文摘要:

We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study EnumIP from dec-DNNF within the framework of enumeration complexity and prove that it is in OutputP, the class of output polynomial enumeration problems, and more precisely in IncP, the class of polynomial incremental time enumeration problems. We then focus on two closely related, but seemingly harder, enumeration problems where further restrictions are put on the prime implicants to be generated. In the first problem, one is only interested in prime implicants representing subset-minimal abductive explanations, a notion much investigated in AI for more than three decades. In the second problem, the target is prime implicants representing sufficient reasons, a recent yet important notion in the emerging field of eXplainable AI, since they aim to explain predictions achieved by machine learning classifiers. We provide evidence showing that enumerating specific prime implicants corresponding to subset-minimal abductive explanations or to sufficient reasons is not in OutputP.

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

↑