A rearrangement search strategy for determining propositional satisfiability

A rearrangement search strategy for determining propositional satisfiability (1988)

by Ramin Zabih

Venue:	in Proceedings of the National Conference on Artificial Intelligence
Citations:	66 - 1 self

Datum	Value	Source
TITLE	A rearrangement search strategy for determining propositional satisfiability	INFERENCE
AUTHOR NAME	Ramin Zabih	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department; Stanford University	SVM HeaderParse 0.2
ABSTRACT	We present a simple algorithm for determining the satis ability of propositional formulas in Conjunctive Normal Form. As the procedure searches for a satisfying truth assignment it dynamically rearranges the order in which variables are considered. The choice of which variable to assign a truth value next is guided by an upper bound on the size of the search remaining � the procedure makes the choice which yields the smallest upper bound on the size of the remaining search. We describe several upper bound functions and discuss the tradeo between accurate upper bound functions and the overhead required to compute the upper bounds. Experimental data shows that for one easily computed upper bound the reduction in the size of the search space more than compensates for the overhead involved in selecting the next variable. 1	SVM HeaderParse 0.2
YEAR	1988	INFERENCE
VENUE	in Proceedings of the National Conference on Artificial Intelligence	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	155--160	INFERENCE
CITATIONS	9 found	ParsCit 1.0