Breaking instance-independent symmetries in exact graph coloring

被引：0
|
作者：
Ramani, Arathi [1 ]
Markov, Igor L. [1 ]
Sakallah, Karem A. [1 ]
Aloul, Fadi A. [2 ]
机构：
[1] Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, United States
[2] Department of Computer Engineering, American University in Sharjah, United Arab Emirates
来源：
Journal of Artificial Intelligence Research | 2006年 / 26卷
关键词：
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems; such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI; such as planning; time-tabling and scheduling. Provably optimal solutions may be desirable for commercial and defense applications. Additionally; for applications such as register allocation and code optimization; naturally-occurring instances of graph coloring are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean satisfiability (SAT) and 0-1 Integer Linear Programming (ILP) suggests generic problem-reduction methods; rather than problem-specific heuristics; because (1) heuristics may be upset by new constraints; (2) heuristics tend to ignore structure; and (3) many relevant problems are provably inapproximable. Problem reductions often lead to highly symmetric SAT instances; and symmetries are known to slow down SAT solvers. In this work; we compare several avenues for symmetry breaking; in particular when certain kinds of symmetry are present in all generated instances. Our focus on reducing CSPs to SAT allows us to leverage recent dramatic improvement in SAT solvers and automatically benefit from future progress. We can use a variety of black-box SAT solvers without modifying their source code because our symmetry-breaking techniques are static; i.e; we detect symmetries and add symmetry breaking predicates (SBPs) during pre-processing. An important result of our work is that among the types of instance-independent SBPs we studied and their combinations; the simplest and least complete constructions are the most effective. Our experiments also clearly indicate that instance-independent symmetries should mostly be processed together with instance-specific symmetries rather than at the specification level; contrary to what has been suggested in the literature. © 2006 AI Access Foundation. All rights reserved;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
页码：289 / 322
相关论文
共 39 条
  • [1] Breaking instance-independent symmetries in exact graph coloring
    Ramani, A
    Aloul, FA
    Markov, IL
    Sakallah, KA
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2004, : 324 - 329
  • [2] Breaking instance-independent symmetries in exact graph coloring
    Ramani, Arathi
    Markov, Igor L.
    Sakallah, Karem A.
    Aloul, Fadi A.
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 26
  • [3] Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
    Ghosh, Avishek
    Sankararaman, Abishek
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [4] Small maximal independent sets and faster exact graph coloring
    Eppstein, D
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 462 - 470
  • [5] Learning instance-independent value functions to enhance local search
    Moll, R
    Barto, AG
    Perkins, TJ
    Sutton, RS
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 11, 1999, 11 : 1017 - 1023
  • [6] An exact method for graph coloring
    Lucet, C
    Mendes, R
    Moukrim, A
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) : 2189 - 2207
  • [7] Block symmetries in graph coloring reconfiguration systems
    Bhakta, Prateek
    Krehbiel, Sara
    Morris, Rachel
    Russell, Heather M.
    Sathe, Aalok
    Su, Wesley
    Xin, Maxine
    ADVANCES IN APPLIED MATHEMATICS, 2023, 149
  • [8] Breaking graph symmetries by edge colourings
    Lehner, Florian
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 205 - 214
  • [9] BREAKING THE SYMMETRIES OF THE BOOK GRAPH AND THE GENERALIZED PETERSEN GRAPH
    Lal, A. K.
    Bhattacharjya, B.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1200 - 1216
  • [10] Symmetries and Exact Solutions of the Breaking Soliton Equation
    Chen Mei
    Liu Xi-Qiang
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2011, 56 (05) : 851 - 855
1234