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

命题加权基的编制

Compilation of Propositional Weighted Bases

Adnan Darwiche, Pierre Marquis

摘要:

在本文中,我们调查在何种程度上可以使用知识编译,以提高推理命题加权基地。我们提出了一个一般的概念编译的加权基地,参数化的任何等价-保持编译功能。消极和积极的结果。一方面,复杂性的结果进行了鉴定,表明从编译加权基地的推理问题是困难的,在一般情况下,当总理暗示,霍恩覆盖或重命名的霍恩覆盖类的目标。另一方面,我们表明,推理问题变得易于处理,每当DNNF编译被使用和子句查询被认为是。此外,我们表明,一个加权基地的DNNF编译的所有首选模型的集合可以在输出大小的时间多项式中计算。最后,我们勾勒出我们的结果可以用于基于模型的诊断,以计算系统的最可能的诊断。

英文摘要:

In this paper, we investigate the extent to which knowledge compilation can be used to improve inference from propositional weighted bases. We present a general notion of compilation of a weighted base that is parametrized by any equivalence--preserving compilation function. Both negative and positive results are presented. On the one hand, complexity results are identified, showing that the inference problem from a compiled weighted base is as difficult as in the general case, when the prime implicates, Horn cover or renamable Horn cover classes are targeted. On the other hand, we show that the inference problem becomes tractable whenever DNNF-compilations are used and clausal queries are considered. Moreover, we show that the set of all preferred models of a DNNF-compilation of a weighted base can be computed in time polynomial in the output size. Finally, we sketch how our results can be used in model-based diagnosis in order to compute the most probable diagnoses of a system.

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

↑