@incollection{,
	
					
					
					E228422ADD775B16F36B26AC0B4320E8
				,
	author={{Dr. BagaisA.} and {AbdullahiM.} and {Ahmadu Bello University, Zaria-Nigeria}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}131716
}

@incollection{b0,
	
	
		,
	title={{Solutions to The Minimization Problem of Fault-Tolerant Logic Circuits}}
		,
	author={{
			AEBarbour
		}}
	
	
		,
	journal={{IEEE Transactions on Computers}}
		
			41
			4
			
			,
	year={1992}
		
	

}

@incollection{b1,
	
	
		,
	title={{A Complete Adaptive Algorithm for Propositional Satisfiability}}
		,
	author={{
			RBruni
		} and {
			S
		}}
		
	
	
		,
	booktitle={{Discrete Applied Mathematics}}
		
			127
			,
	year={2003}
		
	

}

@incollection{b2,
	
	
		,
	title={{The Complexity of Theorem Proving Procedures}}
		,
	author={{
			SCook
		}}
	
	
		,
	booktitle={{Proceedings of the 3rd Annual ACM Symposium on Theory of Computing}}
				the 3rd Annual ACM Symposium on Theory of Computing
		
			,
	year={1971}
			
		
	

}

@book{b3,
	
	
		,
	title={{Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems}}
		,
	author={{
			JMCrawford
		} and {
			ABBaker
		}}
		
		
			,
	year={1994}
			,
	publisher={AAAI-94}
		
	

}

@incollection{b4,
	
	
		,
	title={{A Deterministic (2-2 / k+1)n Algorithm fork-SAT based on Local Search}}
		,
	author={{
			EDanstin
		} and {
			AGoerdt
		} and {
			EAHirsch
		} and {
			RKannan
		} and {
			JKleinberg
		} and {
			CPapadimitriou
		}}
		
		
		
		
		
	
	
		,
	journal={{Theoretical Computer Science}}
		
			
			,
	year={2002}
		
	

}

@incollection{b5,
	
	
		,
	title={{A Computing Procedure for Quantification Theory}}
		,
	author={{
			MDavis
		} and {
			HPutnam
		}}
		
	
	
		,
	journal={{Journal of Association for Computing Machinery}}
		
			
			,
	year={1960}
		
	

}

@incollection{b6,
	
	
		,
	title={{A Computing Procedure for Quantification Theory}}
		,
	author={{
			MDavis
		} and {
			HPutnam
		}}
		
	
	
		,
	journal={{Journal of Association for Computing Machinery}}
		
			
			,
	year={1960}
		
	

}

@book{b7,
	
	
		,
	title={{A Machine Program for Theorem Proving}}
		,
	author={{
			MDavis
		} and {
			GLogemann
		} and {
			DLoveland
		}}
		
		
		
			,
	year={1962}
		
	

}

@incollection{b8,
	
	
		,
	title={{Optimal Layout via Boolean Satisfiability}}
		,
	author={{
			SDevadas
		}}
	
	
		,
	booktitle={{Proceedings of ICCAD 89}}
				ICCAD 89
		
			,
	year={1989}
			
		
	

}

@book{b9,
	
	
		,
	title={{Improvements to Propositional Satisfiability Search Algorithms}}
		,
	author={{
			JWFreeman
		}}
		
			,
	year={1995}
		
		
			Computer and Information Science, University of Pennsylvania
		
	
	,
	note={Ph. D. Dissertation. Department of}

}

@incollection{b10,
	
	
		,
	title={{New Worst Case Upper Bounds for SAT}}
		,
	author={{
			EHirsch
		}}
	
	
		,
	journal={{Journal of Automated Reasoning}}
		
			24
			
			,
	year={2000}
		
	

}

@incollection{b11,
	
	
		,
	title={{Two New Upper Bounds for SAT}}
		,
	author={{
			EHirsch
		}}
	
	
		,
	booktitle={{Proceedings of 9th Annual ACM Siam Symposium on Discrete Algorithms}}
				9th Annual ACM Siam Symposium on Discrete Algorithms
		
			,
	year={1998}
			
		
	

}

@book{b12,
	
	
		,
	title={{Branching Rules for Satisfiability. GSIA Working Paper 1994-09. Pennsylvania: Graduate School of Industrial Administration}}
		,
	author={{
			JNHooker
		} and {
			VVinay
		}}
		
		
			,
	year={1994}
			,
	address={Pittsburgh}
		
		
			Carnegie-Mellon University
		
	

}

@incollection{b13,
	
	
		,
	title={{Solving Propositional Satisfiability Problems}}
		,
	author={{
			RGJeroslow
		} and {
			JWang
		}}
		
	
	
		,
	journal={{Annals of Mathematics & Artificial Intelligence}}
		
			1
			
			,
	year={1990}
		
	

}

@incollection{b14,
	
	
		,
	title={{Planning as Satisfiability}}
		,
	author={{
			HKauts
		} and {
			BSelman
		}}
		
	
	
		,
	booktitle={{Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 92}}
				the 10th European Conference on Artificial Intelligence (ECAI 92
		
			,
	year={1992}
		
	

}

@incollection{b15,
	
	
		,
	title={{New Methods for 3-SAT Decision and Worst Case Analysis}}
		,
	author={{
			OKullmann
		}}
	
	
		,
	journal={{Theoretical Computer Science}}
		
			
			,
	year={1999}
		
	

}

@incollection{b16,
	
	
		,
	title={{Test Pattern Generation Using Boolean Satisfiability}}
		,
	author={{
			TLarrabee
		}}
	
	
		,
	journal={{IEEE Transactions Computer Aided Design}}
		
			1
			
			,
	year={1992}
		
	

}

@incollection{b17,
	
	
		,
	title={{Heuristics Based on Unit Propagation for Satisfiability Problems}}
		,
	author={{
			CMLi
		} and {
			Anbulagan
		}}
		
	
	
		,
	booktitle={{Proceedings of 15th International Joint Conference on Artificial Intelligence}}
				15th International Joint Conference on Artificial IntelligenceNagoya, Japan
		
			,
	year={1997}
			1
			
		
	

}

@incollection{b18,
	
	
		,
	title={{Building Stateof-The-Art SAT Solver}}
		,
	author={{
			ILynce
		} and {
			JMarques-Silva
		}}
		
	
	
		,
	booktitle={{Proceedings of the European Conference on Artificial Intelligence (ECAI)}}
				the European Conference on Artificial Intelligence (ECAI)
		
			,
	year={2002}
			105
		
	

}

@book{b19,
	
	
		,
	title={{The Effect of Nogood Recording in MAC-CBJ SAT Algorithms}}
		,
	author={{
			ILynce
		} and {
			JPSilva
		}}
		
		RT/4/2002
		
			,
	year={2002}
		
	
	,
	note={Technical Report}

}

@incollection{b20,
	
	
		,
	title={{}}
		,
	author={{
			JPMarques-Silva
		} and {
			KASakallah
		}}
		
	
	
		,
	journal={{IEEE Transactions on Computers. GRASP-A Search Algorithm for Propositional Satisfiability}}
		
			
			,
	year={1999}
		
	

}

@incollection{b21,
	
	
		,
	title={{Solving Satisfiability in less than 2n steps}}
		,
	author={{
			BMonien
		} and {
			ESpeckenmeyer
		}}
		
	
	
		,
	journal={{Discrete Applied Mathematics}}
		
			
			,
	year={1985}
		
	

}

@incollection{b22,
	
	
		,
	title={{Engineering an Efficient SAT Solver}}
		,
	author={{
			MMoskewicz
		} and {
			CMadigan
		} and {
			YZhao
		} and {
			LZhang
		} and {
			SMalik
		}}
		
		
		
		
	
	
		,
	booktitle={{Proceedings of the Design Automation Conference}}
				the Design Automation Conference
		
			,
	year={2001}
		
	

}

@incollection{b23,
	
	
		,
	title={{Efficient and Stability of Hypergraph SAT Algorithms}}
		,
	author={{
			DPretolani
		}}
	
	
		,
	booktitle={{Proceedings of DIMACS Challenge II Workshop}}
				DIMACS Challenge II Workshop
		
			,
	year={1993}
		
	

}

@book{b24,
	
	
		,
	author={{
			KHRosen
		}}
		,
	title={{Discrete Mathematics and Its Applications}}
				
			,
	publisher={McGraw Hill}
			,
	year={1999}
		
	
	,
	note={4th Edition ed.}

}

@incollection{b25,
	
	
		,
	title={{Solving 3-Satisfiability in less than 1.579n}}
		,
	author={{
			ISchiermeyer
		}}
	
	
		,
	booktitle={{Selected papers from Computer Science Logic 12}}
				
			,
	year={1993}
			702
			
		
	

}

@incollection{b26,
	
	
		,
	title={{A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems}}
		,
	author={{
			USchoning
		}}
	
	
		,
	booktitle={{Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS)}}
				the 40th Annual Symposium on Foundations of Computer Science (FOCS)
		
			,
	publisher={IEEE}
			,
	year={1999}
			
		
	

}

@incollection{b27,
	
	
		,
	title={{Forward Reasoning & Dependencydirected Backtracking in A System for Computeraided Circuit Analysis}}
		,
	author={{
			RMStallman
		} and {
			GJSussman
		}}
		
	
	
		,
	journal={{Artificial Intelligence}}
		
			9
			
			,
	year={1977}
		
	
	,
	note={Artificial Intelligence 9}

}