Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dynamic Variable Filtering for Hard Random 3-SAT Problems
 

Summary: Dynamic Variable Filtering for Hard Random
3-SAT Problems
Anbulagan, John Thornton, and Abdul Sattar
Knowledge Representation and Reasoning Unit (KRRU)
School of Information Technology
Griffith University, Gold Coast Campus
PMB 50 Gold Coast Mail Centre, QLD 9726, Australia
{a.anbulagan, j.thornton, a.sattar}@griffith.edu.au
Telephone: (07) 5552 8730, Fax: (07) 5552 8066
Abstract. The DPL (Davis-Putnam-Logemann-Loveland) procedure is
one of the most effective methods for solving SAT problems. It is well
known that its efficiency depends on the choice of the branching rule.
One of the main improvements of this decision procedure has been the
development of better branching variable selection through the use of
unit propagation look-ahead (UPLA) heuristics (e.g., [12]). UPLA heuris-
tics perform one of the following actions during two propagations of a
free variable at each search tree node: detecting a contradiction earlier,
simplifying the formula, or weighing the branching variable candidates.
UPLA heuristics can be considered as polynomial time reasoning tech-
niques. In this paper, we propose a new branching rule which does more

  

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

 

Collections: Computer Technologies and Information Sciences