首页> 外文会议>European Conference on Artificial Intelligence >The Complexity of Handling Minimal Solutions in Logic-Based Abduction
【24h】

The Complexity of Handling Minimal Solutions in Logic-Based Abduction

机译:基于逻辑的绑架中处理最小解决方案的复杂性

获取原文

摘要

Logic-based abduction is an important reasoning method with many applications in Artificial Intelligence including diagnosis, planning, and configuration. The goal of an abduction problem is to find a "solution", i.e., an explanation for some observed symptoms. Usually, many solutions exist, and one is often interested in minimal ones only. Previous definitions of "solutions" to an abduction problem tacitly made an open-world assumption. However, as far as minimality is concerned, this assumption may not always lead to the desired behavior. To overcome this problem, we propose a new definition of solutions based on a closed-world approach. Moreover, we also introduce a new variant of minimality where only a part of the hypotheses is subject to minimization. A thorough complexity analysis reveals the close relationship between these two new notions as well as the differences compared with previous notions of solutions.
机译:基于逻辑的绑架是一种具有许多人工智能应用的重要推理方法,包括诊断,规划和配置。绑架问题的目标是找到“解决方案”,即一些观察到的症状的解释。通常,存在许多解决方案,并且一个人通常对最小的解决方案感兴趣。以前的“解决方案”定义对绑架问题默许开放的世界假设。然而,只要最小的担忧,这种假设可能并不总是导致所需的行为。为了克服这个问题,我们提出了基于封闭世界方法的新定义。此外,我们还引入了一种新的最小值变体,其中仅一部分假设可能会最小化。彻底的复杂性分析揭示了这两个新概念之间的密切关系以及与先前的解决方案概念相比的差异。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号