基于加权比较器网络的Boosting答案集优化
Boosting Answer Set Optimization with Weighted Comparator Networks
摘要:
回答集编程(ASP)是一种建模知识密集型领域和解决具有挑战性的推理问题的范例。在ASP求解中,一个典型的策略是通过将复杂的规则重写为简单的规则来预处理问题实例。规范化是一个重写过程,它完全删除扩展规则类型,以支持普通规则。最近,这些技术导致了ASP中的优化重写,其目标是通过重构感兴趣的优化标准来提高答案集优化。在本文中,我们提出了一种新的,通用的,有效的技术,优化重写的基础上比较器网络,这是一种特殊的电路重新排序的元素的向量。其思想是将比较器网络的ASP编码连接到正在优化的文字,并在网络结构上重新分配这些文字的权重。编码捕获信息的权重的答案集在辅助原子的结构化的方式,被证明是产生指数级的改进,在分支定界优化的一个无限的家庭的例子程序。所使用的比较器网络可以自由调谐,例如,找到给定基准类的最佳大小。实验表明,加速优化性能的几个基准问题。
英文摘要:
Answer set programming (ASP) is a paradigm for modeling knowledge intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting complex rules into simpler ones. Normalization is a rewriting process that removes extended rule types altogether in favor of normal rules. Recently, such techniques led to optimization rewriting in ASP, where the goal is to boost answer set optimization by refactoring the optimization criteria of interest. In this paper, we present a novel, general, and effective technique for optimization rewriting based on comparator networks, which are specific kinds of circuits for reordering the elements of vectors. The idea is to connect an ASP encoding of a comparator network to the literals being optimized and to redistribute the weights of these literals over the structure of the network. The encoding captures information about the weight of an answer set in auxiliary atoms in a structured way that is proven to yield exponential improvements during branch-and-bound optimization on an infinite family of example programs. The used comparator network can be tuned freely, e.g., to find the best size for a given benchmark class. Experiments show accelerated optimization performance on several benchmark problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。