Implementing the Davis-Putnam Method

Implementing the Davis-Putnam Method (2000)

by Hantao Zhang , Mark E. Stickel

Venue:	Journal of Automated Reasoning
Citations:	47 - 3 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Implementing the Davis-Putnam Method	INFERENCE
AUTHOR NAME	Hantao Zhang	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science, The University of Iowa, Iowa City	SVM HeaderParse 0.2
AUTHOR ADDR	IA 52242, U.S.A.	SVM HeaderParse 0.1
AUTHOR NAME	Mark E. Stickel	SVM HeaderParse 0.1
AUTHOR AFFIL	y; Artificial Intelligence Center, SRI International, Menlo Park	SVM HeaderParse 0.2
AUTHOR ADDR	CA 94025, U.S.A.	SVM HeaderParse 0.1
ABSTRACT	The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis-Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis-Putnam method efficiently using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the Davis-Putnam method can work better when unit subsumption is not used. We illustrate the performance of our programs on some quasigroup problems. The efficiency of our programs has enabled us to solve some open quasigroup problems.	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	Journal of Automated Reasoning	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	277--296	INFERENCE
VOLUME	24	INFERENCE
CITATIONS	19 found	ParsCit 1.0