[论文解读] Interactive Debugging of Knowledge Bases

Patrick Rodler|arXiv (Cornell University)|May 19, 2016

AI-based Problem Solving and Planning参考文献 15被引用 42

一句话总结

本文提出了一种完整、可靠且侵入性最小的交互式调试方法，用于单调知识库，通过用户对预期和非预期蕴含关系的查询实现。通过基于冲突集的查询迭代修剪候选解，该方法在保证理论正确性和效率的前提下，收敛到单一语义正确的修复方案。

ABSTRACT

Many AI applications rely on knowledge about a relevant real-world domain that is encoded by means of some logical knowledge base (KB). The most essential benefit of logical KBs is the opportunity to perform automatic reasoning to derive implicit knowledge or to answer complex queries about the modeled domain. The feasibility of meaningful reasoning requires KBs to meet some minimal quality criteria such as logical consistency. Without adequate tool assistance, the task of resolving violated quality criteria in KBs can be extremely tough even for domain experts, especially when the problematic KB includes a large number of logical formulas or comprises complicated logical formalisms. Published non-interactive debugging systems often cannot localize all possible faults (incompleteness), suggest the deletion or modification of unnecessarily large parts of the KB (non-minimality), return incorrect solutions which lead to a repaired KB not satisfying the imposed quality requirements (unsoundness) or suffer from poor scalability due to the inherent complexity of the KB debugging problem. Even if a system is complete and sound and considers only minimal solutions, there are generally exponentially many solution candidates to select one from. However, any two repaired KBs obtained from these candidates differ in their semantics in terms of entailments and non-entailments. Selection of just any of these repaired KBs might result in unexpected entailments, the loss of desired entailments or unwanted changes to the KB. This work proposes complete, sound and optimal methods for the interactive debugging of KBs that suggest the one (minimally invasive) error correction of the faulty KB that yields a repaired KB with exactly the intended semantics. Users, e.g. domain experts, are involved in the debugging process by answering automatically generated queries about the intended domain.

研究动机与目标

• 解决非交互式调试工具的局限性，这些工具在大型或复杂知识库中常存在不完整性、非最小化、不正确或可扩展性差的问题。
• 使领域专家能够通过针对蕴含关系的针对性查询，与系统交互，高效定位并修复知识库中的故障。
• 确保修复后的知识库保留所有期望的语义属性，避免意外更改或引入新故障。
• 为交互式调试提供理论基础，包括冲突集、诊断和查询划分等关键概念的定义。
• 开发保证在最小用户交互和计算开销下收敛到正确诊断的算法。

提出的方法

• 从不一致的知识库中构建最小冲突集，以识别导致不一致的公式子集。
• 基于领先诊断对生成用户查询，每个查询通过测试特定公式的蕴含关系来区分两个候选修复。
• 使用Q-划分来建模每个查询回答对剩余解空间的影响，从而系统性地修剪诊断。
• 实现两种迭代诊断计算算法：staticHS（静态剪枝）和 dynamicHS（动态、自适应剪枝），以高效减少搜索空间。
• 应用击中集树技术来表示和遍历诊断空间，通过用户回答指导剪枝，以最小化计算量。
• 集成基于概率和基于熵的查询选择策略，以最小化达到收敛所需的查询数量。

实验结果

研究问题

• RQ1 交互式调试能否在确保最小侵入性的前提下，实现知识库的完整且可靠的修复？
• RQ2 如何生成用户查询以最大化信息增益，并最小化识别正确诊断所需的交互次数？
• RQ3 交互式调试算法的正确性和收敛性可提供哪些理论保证？
• RQ4 不同查询选择策略（如基于熵或风险优化的策略）在查询效率和可扩展性方面有何比较？
• RQ5 高级推理技术与热点检测在大型知识库中能否显著提升交互式调试的性能？

主要发现

• 所提出的交互式调试框架具有可靠性和完整性，保证仅建议最小且正确的修复方案。
• dynamicHS算法通过实时适应用户回答，实现对诊断搜索空间的显著剪枝，从而提高效率。
• 基于熵的查询选择可减少识别正确诊断所需的期望查询数量，优于朴素策略。
• staticHS算法通过保证剪枝，在高基数故障场景下仍能确保收敛到正确诊断。
• 集成溯源信息与用户角色信息可增强查询推荐系统，实现专家感知的调试工作流。
• 未来工作表明，热点检测与模块化推理（如结合HermiT与ELK）可进一步提升大型知识库中交互式调试的可扩展性。