Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Noname manuscript No. (will be inserted by the editor)
 

Summary: Noname manuscript No.
(will be inserted by the editor)
Dynamic Symmetry-Breaking for Boolean
Satisfiability
Fadi A. Aloul1, Arathi Ramani2, Igor L. Markov3 and Karem A. Sakallah3
1 Dept. of Computer Engineering, American University of Sharjah, UAE, faloul@aus.edu
2 Microsoft Corp., Redmond, Washington, USA, arathira@windows.microsoft.com
3 Dept. of EECS, University of Michigan, Ann Arbor, USA, {imarkov, karem}@eecs.umich.edu
Abstract With impressive progress in Boolean Satisfiability (SAT) solving and
several extensions to pseudo-Boolean (PB) constraints, many applications that use
SAT, such as high-performance formal verification techniques are still restricted
to checking satisfiability of certain conditions. However, there is also frequently
a need to express a preference for certain solutions. Extending SAT-solving to
Boolean optimization allows the use of objective functions to describe a desir-
able solution. Although recent work in 0-1 Integer Linear Programming (ILP) of-
fers extensions that can optimize a linear objective function, this is often achieved
by solving a series of SAT or ILP decision problems. Our work articulates some
pitfalls of this approach. An objective function may complicate the use of any
symmetry that might be present in the given constraints, even when the con-
straints are unsatisfiable and the objective function is irrelevant. We propose sev-

  

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

 

Collections: Engineering