arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.5033cs.LO
收藏

解集程序设计的对称破缺

Symmetry Breaking for Answer Set Programming

Christian Drescher

摘要:

在答案集编程的背景下,这项工作研究对称性检测和对称性破缺,以消除对称部分的搜索空间,从而简化求解过程。我们有助于减少对称性检测的图形自同构问题,它允许提取对称性的逻辑程序的对称性构造的彩色图。我们还提出了一个编码的破坏性的约束条件的置换循环,并在这个过程中只使用发电机隐含地表示对称性,总是与指数压缩。这些想法被制定为预处理,并在一个完全自动化的流程中实现,该流程首先从给定的答案集程序中检测对称性,增加了破坏性约束,并可以应用于任何现有的答案集求解器。我们展示了计算的基准与直接应用的求解器的影响。此外,我们探讨对称破缺的答案集编程在两个领域:第一,约束答案集编程作为一种新的方法来表示和解决约束满足问题,第二,分布式非单调多上下文系统。特别是,我们制定了一个基于约束的方法来解决问题的答案集,它允许我们的对称性检测和对称性破缺方法的应用。为了比较它们的性能与先验对称破缺技术,我们还贡献了一个分解的全局值优先约束,通过单位传播的答案集求解器执行域一致性的原始约束。我们在实证分析中评估这两种选择。在分布式非单调多上下文系统的背景下,我们开发了一个分布式对称性检测算法,并携带分布式答案集规划的破缺约束。

英文摘要:

In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. These ideas are formulated as preprocessing and implemented in a completely automated flow that first detects symmetries from a given answer set program, adds symmetry-breaking constraints, and can be applied to any existing answer set solver. We demonstrate computational impact on benchmarks versus direct application of the solver. Furthermore, we explore symmetry breaking for answer set programming in two domains: first, constraint answer set programming as a novel approach to represent and solve constraint satisfaction problems, and second, distributed nonmonotonic multi-context systems. In particular, we formulate a translation-based approach to constraint answer set solving which allows for the application of our symmetry detection and symmetry breaking methods. To compare their performance with a-priori symmetry breaking techniques, we also contribute a decomposition of the global value precedence constraint that enforces domain consistency on the original constraint via the unit-propagation of an answer set solver. We evaluate both options in an empirical analysis. In the context of distributed nonmonotonic multi-context system, we develop an algorithm for distributed symmetry detection and also carry over symmetry-breaking constraints for distributed answer set programming.

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

↑