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

基于SAT和基于ASP的不一致性度量算法比较

Comparison of SAT-based and ASP-based Algorithms for Inconsistency Measurement

University of Hagen(哈根大学);University of Koblenz(科布伦茨大学)

Isabelle Kuhlmann, Anna Gessler, Vivien Laszlo, Matthias Thimm

AI总结:

本文提出基于SAT和ASP的算法来确定命题知识库中六种不一致性度量,实验表明基于SAT和ASP的方法在运行时间上均优于朴素基线,且基于ASP的方法在所有度量上均优于基于SAT的方法。

摘要:

我们提出了基于可满足性问题(SAT)求解以及回答集编程(ASP)的算法,用于解决确定命题知识库中不一致性程度的问题。我们考虑了六种不同的不一致性度量,其各自的决策问题位于多项式层次结构的第一层。即,这些度量分别是contension不一致性度量、基于遗忘的不一致性度量、击中集不一致性度量、最大距离不一致性度量、总和距离不一致性度量以及击中距离不一致性度量。在广泛的实验分析中,我们将基于SAT和基于ASP的方法相互进行比较,并与一组朴素基线算法进行比较。我们的结果表明,总体而言,在运行时间方面,基于SAT和基于ASP的方法均明显优于朴素基线方法。结果进一步表明,针对本文考虑的所有六种不一致性度量,所提出的基于ASP的方法均优于基于SAT的方法。此外,我们进行了额外的实验以更详细地解释上述结果。

英文摘要:

We present algorithms based on satisfiability problem (SAT) solving, as well as answer set programming (ASP), for solving the problem of determining inconsistency degrees in propositional knowledge bases. We consider six different inconsistency measures whose respective decision problems lie on the first level of the polynomial hierarchy. Namely, these are the contension inconsistency measure, the forgetting-based inconsistency measure, the hitting set inconsistency measure, the max-distance inconsistency measure, the sum-distance inconsistency measure, and the hit-distance inconsistency measure. In an extensive experimental analysis, we compare the SAT-based and ASP-based approaches with each other, as well as with a set of naive baseline algorithms. Our results demonstrate that overall, both the SAT-based and the ASP-based approaches clearly outperform the naive baseline methods in terms of runtime. The results further show that the proposed ASP-based approaches perform superior to the SAT-based ones with regard to all six inconsistency measures considered in this work. Moreover, we conduct additional experiments to explain the aforementioned results in greater detail.

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

↑