Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symmetry Breaking for Pseudo-Boolean FADI A. ALOUL
 

Summary: Symmetry Breaking for Pseudo-Boolean
Formulas
FADI A. ALOUL
American University of Sharjah
and
ARATHI RAMANI, IGOR L. MARKOV, and KAREM A. SAKALLAH
University of Michigan, Ann Arbor
Many important tasks in design automation and artificial intelligence can be performed in practice
via reductions to Boolean satisfiability (SAT). However, such reductions often omit application-
specific structure, thus handicapping tools in their competition with creative engineers. Successful
attempts to represent and utilize additional structure on Boolean variables include recent work
on 0-1 integer linear programming (ILP) and symmetries in SAT. Those extensions gracefully
accommodate well-known advances in SAT solving, however, no previous work has attempted to
combine both extensions. Our work shows (i) how one can detect and use symmetries in instances
of 0-1 ILP, and (ii) what benefits this may bring.
Categories and Subject Descriptors: I.1 [Computing Methodologies]: Symbolic and Algebraic
Manipulation--Expressions and their representation, algorithms
General Terms: Algorithms, Experimentation
Additional Key Words and Phrases: Graph automorphism
ACM Reference Format:

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering