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

分布式多上下文系统的对称破缺

Symmetry Breaking for Distributed Multi-Context Systems

Christian Drescher, Thomas Eiter, Michael Fink, Thomas Krennwallner, Toby Walsh

摘要:

异构非单调多上下文系统(MCS)允许在不同的上下文中使用不同的逻辑,并通过桥规则将它们连接起来。我们调查的对称性检测和对称性破缺在这样的系统中的作用,以消除对称部分的搜索空间,从而简化评估过程。我们提出了一个分布式算法,采取局部立场,即,独立地计算上下文的部分对称性,并且为了构造整体的潜在对称性,将它们与由相邻上下文返回的那些部分对称性组合。我们证明了我们的方法的正确性。我们实例化这样的对称性检测和对称性破缺在一个多上下文系统的背景下,使用答案集程序,并证明计算的好处,最近提出的一些基准。

英文摘要:

Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetric parts of the search space and, thereby, simplify the evaluation process. We propose a distributed algorithm that takes a local stance, i.e., computes independently the partial symmetries of a context and, in order to construct potential symmetries of the whole, combines them with those partial symmetries returned by neighbouring contexts. We prove the correctness of our methods. We instantiate such symmetry detection and symmetry breaking in a multi-context system with contexts that use answer set programs, and demonstrate computational benefit on some recently proposed benchmarks.

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

↑