{"type":"ScholarlyArticle","title":"Theoretical Analysis of Davis-Putnam Procedure and Propositional Satisfiability","authors":[{"name":"Nobuhiro Yugami","slug":"nobuhiro-yugami","given":"Nobuhiro","family":"Yugami","affiliation":""}],"abstract":"This paper presents a statistical analysis of the Davis-Putnam procedure and propositional satisfiability problems (SAT} . SAT has been researched in AI because of its strong relationship to automated reasoning and recently it is used as a benchmark problem of constraint satisfaction algorithms. The Davis-Putnam procedure is a wellknown satisfiability checking algorithm based on tree search technique. In this paper, I analyze two average case complexities for the Davis-Putnam procedure, the complexity for satisfiability checking and the complexity for finding all solutions. I also discuss the probability of satisfiability. The complexities and the probability strongly depend on the distribution of formulas to be tested and I use the fixed clause length model as the distribution model. The result of the analysis coincides with the experimental result well.","doi":null,"url":"https://ijcai.org/proceedings/1995/37","pdf":"https://ijcai.org/proceedings/1995/0037.pdf","markdown":"https://ijcai.org/proceedings/1995/37.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/37","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":37,"pages":{"first":282,"last":287},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}