Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Solving Satisfiability using Decomposition and the Most Constrained Subproblem Eyal Amir and Sheila McIlraith
 

Summary: Solving Satisfiability using Decomposition and the Most Constrained Subproblem
Eyal Amir and Sheila McIlraith
Department of Computer Science,
Gates Building, Wing 2A
Stanford University, Stanford, CA 94305-9020, USA
{eyal.amir,sheila.mcilraith}@cs.stanford.edu
Abstract
In this paper we provide SAT-solving procedures
that use the idea of decomposition together with the
heuristic of solving the most constrained subprob-
lem first. We present two approaches. We provide
an algorithm to find the most constrained subprob-
lem of a propositional SAT problem in polynomial
time. We use this algorithm iteratively to decom-
pose a SAT problem into partitions. We also pro-
vide a polynomial-time algorithm that uses the idea
of minimum vertex separators iteratively to provide
different decompositions. We show how to solve
SAT problems, using these algorithms to empha-
size solving the most constrained subproblem first.

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences