首页> 外文期刊>Artificial intelligence >Pruning external minimality checking for answer set programs using semantic dependencies
【24h】

Pruning external minimality checking for answer set programs using semantic dependencies

机译:使用语义依赖项修剪外部最小性检查答案设置程序

获取原文
获取原文并翻译 | 示例

摘要

Answer set programming (ASP) has become an increasingly popular approach for declarative problem solving. In order to address the needs of applications, ASP has been extended in different approaches with means for interfacing the outside world, of which hex programs are one of the most powerful such extension that provides API-style interfaces to access arbitrary external sources of information and computation, respectively. Adhering to the principle of founded derivation, computing answer sets of hex programs requires an external (e-) minimality check for answer set candidates in order to prevent cyclic justifications via external sources. Due to the generic nature of external sources, the check can be a bottleneck in practice. To mitigate this, various optimizations have been developed previously, including the use of syntactic information about atom dependencies in order to detect cases when an e-minimality check can be avoided. However, the approach largely over-approximates the real dependencies due to the black-box nature of external sources. We thus consider in this work the use of semantic information for achieving better approximations. To this end, we introduce input-output (io-) dependencies for external sources, which intuitively link the occurrence of values in the result of a call to an external source to the occurrence of values in the input provided to this call. It appears that disposing of information about io-dependencies significantly increases the potential for pruning e-minimality checks, and an empirical evaluation exhibits a clear benefit of this approach. Moreover, we study semantic and computational properties of io-dependencies and provide algorithms for constructing and optimizing sets of io-dependencies. Our work aims at laying some foundations for the use of semantic dependency information in external source access from ASP. The results are not limited to hex programs, but may analogously be deployed to other approaches that integrate external sources into ASP, such as CLINGO or WASP with external propagators. Furthermore, the results may be applied in other parts of the hex program evaluation pipeline as well.
机译:答案集编程(ASP)已成为声明解决问题的越来越流行的方法。为了解决应用程序的需求,ASP已经以不同的方法扩展,具有接口外界的手段,其中十六进制程序是提供API样式接口以访问任意外部信息源的最强大的此类扩展方法之一分别计算。遵守成立阶级的原则,六十六进制程序的计算答案组需要外部(E-)最小的检查答案设置候选者,以防止通过外部来源的循环理由。由于外部来源的通用性质,检查可以是实践中的瓶颈。为了缓解这一点,先前已经开发了各种优化,包括使用关于原子依赖性的语法信息,以便在可以避免电子最小值检查时检测案例。然而,由于外部来源的黑匣子性质,该方法在很大程度上过度近似于实际依赖性。因此,我们考虑在这项工作中,使用语义信息来实现更好的近似。为此,我们向外部源引入输入 - 输出(IO-)依赖性,这直观地将呼叫的结果的值与外部源的结果进行了直观地链接到提供给该呼叫的输入中的值的发生。看来,处理有关IO-依赖性的信息显着增加了修剪e-mixally检查的可能性,并且经验评估表现出这种方法的明显益处。此外,我们研究IO-依赖性的语义和计算属性,并为构建和优化IO依赖性集提供算法。我们的工作旨在为来自ASP的外部源访问中的语义依赖信息奠定一些基础。结果不限于十六进制程序,但可能类似地部署到其他方法,将外部源集成到ASP,例如Clingo或WASP,与外部传播者。此外,结果可以应用于十六进制计划评估管道的其他部分。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号