By Topic

A branching heuristic for testing propositional satisfiability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jinchang Wang ; Dept. of Bus. & Econ., Missouri Western State Coll., St. Joseph, MO, USA

This paper presents a heuristic criterion in selecting the branching variable in searching for a satisfiable solution to a propositional formula. The heuristic is a modification of the one used in the Jeroslow-Wang method (1990). It gives more chances by analysis to locate a satisfiable solution, and is supposed to reduce the searching tree and searching time in some cases

Published in:

Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:5 )

Date of Conference:

22-25 Oct 1995