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

对称破缺答案集求解

Symmetry-breaking Answer Set Solving

Christian Drescher, Oana Tifrea, Toby Walsh

摘要:

在答案集编程的背景下,本文研究了破缺,以消除对称部分的搜索空间,从而简化求解过程。我们提出了一个减少的析取逻辑程序的着色有向图,使置换对称可以从图的自同构。然后通过引入对称破坏约束来破坏对称。为此,我们制定了一个预处理器,集成了图自同构系统。实验证明了其计算效果。

英文摘要:

In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact.

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

↑