New Developments in Symmetry Breaking in Search Using Computational Group Theory
نویسندگان
چکیده
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in CSPs. In this paper we analyse the structure of symmetry groups of CSPs, and implement several combinations of GE-trees and the classical SBDD method for breaking all symmetries. We prove the efficacy of our techniques, and present preliminary experimental evidence of their practical efficiency.
منابع مشابه
GAPLex: Combining Static and Dynamic Symmetry Breaking
We describe a novel and effective suite of algorithms that combine the efficiency and ease of use of lex-ordering, with the power of breaking symmetry in CSPs by using computational group theory during search. We show that our new symmetry breaking method, GAPLex, is sound (will neither lose solutions nor return incorrect solutions) and complete (will return exactly one member from each class o...
متن کاملA Computational Study to Find the Vibrational Modes Connected with Specific Molecular Structures of Calculated Compound
The purpose of this research is to provide a deeper understanding of the planar high- symmetry configuration instability. In the ideal case, the distortion corresponds to the movements of nuclei along normal modes that belong to non-totally symmetric irreps of the high symmertry (HS) point group of molecule. The analysis of the structural distortion from the HS nuclear arrangements of the JT ac...
متن کاملنظریه میدان ناجابهجایی و پارامترهای نقض لورنتس در QED
Non-commutative field theory as a theory including the Lorentz violation can be constructed in two different ways. In the first method, the non-commutative fields are the same as the ordinary ones while the gauge group is restricted to U(n). For example, the symmetry group of standard model in non-commutative space is U(3)×(2)×U(1) which can be reduced to SU(3)×SU(2)×U(1) by two appropriate spo...
متن کاملGeneric SBDD Using Computational Group Theory
We introduce a novel approach for symmetry breaking by dominance detection (SBDD). The essence of SBDD is to perform ‘dominance checks’ at each node in a search tree to ensure that no symmetrically equivalent node has been visited before. While a highly effective technique for dealing with symmetry in constraint programs, SBDD forces a major overhead on the programmer, of writing a dominance ch...
متن کاملIntegrating symmetry breaking into a DLL procedure
Many real-world problems have interesting symmetries. Encoding these problems into CNF formulas generally results in hard SAT problems. Examples includes the pigeon hole problem, which, although very simple, is nonpolynomial for any resolution-based method when encoded into SAT [6], and the n queen problem. In order to speed up search algorithms for these problems, intrinsic symmetries should b...
متن کامل