The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all case
How good are branching rules in DPLL?
โ Scribed by Ming Ouyang
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 346 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
โฆ Synopsis
The Davis-Putnam-LogemannLoveland algorithm is one of the most popular algorithms for solving the satisfiability problem.
Its efficiency depends on its choice of a branching rule. We construct a sequence of instances of the satisfiability problem that fools a variety of "sensible" branching rules in the following sense: when the instance has n variables, each of the "sensible" branching rules brings about 62(2"5) recursive calls of the Davis-Putnam-Logemanll-Loveland algorithm, even though only 0( I ) such calls are necessary.
๐ SIMILAR VOLUMES
## Abstract Basically, companies and laboratories implement production methods for their electrodes on the basis of experience, technical capabilities and commercial preferences. But how does one know whether they have ended up with the best possible electrode for the components used? What should b
Prior studies of judgemental time-series forecasting have found that people have problems with downward-sloping series. This laboratory-based study presents a controlled experiment of series direction and it investigates the problems of changing trends. Results conยฎrm that people have signiยฎcant dic