Title :
A branching heuristic for testing propositional satisfiability
Author_Institution :
Dept. of Bus. & Econ., Missouri Western State Coll., St. Joseph, MO, USA
Abstract :
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
Keywords :
computability; formal logic; heuristic programming; branching heuristic; branching variable selection; heuristic criterion; propositional satisfiability testing; searching time reduction; searching tree reduction; Algorithms; Cost accounting; Educational institutions; Linear programming; Page description languages; Performance evaluation; Testing;
Conference_Titel :
Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
0-7803-2559-1
DOI :
10.1109/ICSMC.1995.538456
