Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Heuristics Based on Unit Propagation for Satis ability Problems Chu Min Li & Anbulagan
 

Summary: Heuristics Based on Unit Propagation for Satis ability Problems
Chu Min Li & Anbulagan
LaRIA, Univ. de Picardie Jules Verne, 33, Rue St. Leu, 80039 Amiens Cedex, France
fax: (33) 3 22 82 75 02, e-mail: fcli@laria.u-picardie.fr, Anbulagan@utc.frg
Abstract
The paper studies new unit propagation based
heuristics for Davis-Putnam-Loveland (DPL)
procedure. These are the novel combinationsof
unit propagation and the usual "MaximumOc-
currences in clauses of Minimum Size" heuris-
tics. Based on the experimental evaluations of
di erent alternatives a new simple unit prop-
agation based heuristic is put forward. This
compares favorably with the heuristics em-
ployed in the current state-of-the-art DPL im-
plementations (C-SAT, Tableau, POSIT).
1 Introduction
Consider a propositional formula F in Conjunctive
Normal Form (CNF) on a set of Boolean variables
fx1 x2 ::: xng, the satis ability (SAT) problem consists

  

Source: Anbulagan, A. - National ICT Australia & Computer Sciences Laboratory, Australian National University

 

Collections: Computer Technologies and Information Sciences