DPvis – A Tool to Visualize the Structure of SAT Instances
We present DPvis, a Java tool to visualize the structure of SAT instances and runs of the DPLL (Davis-Putnam-Logemann-Loveland) procedure. DPvis uses advanced graph layout algorithms to display the problem’s internal structure arising from its variable dependency (interaction) graph. DPvis is also able to generate animations showing the dynamic change of a problem’s structure during a typical DPLL run. Besides implementing a simple variant of the DPLL algorithm on its own, DPvis also features an interface to MiniSAT, a state-of-the-art DPLL implementation. Using this interface, runs of MiniSAT can be visualized—including the generated search tree and the effects of clause learning. DPvis is supposed to help in teaching the DPLL algorithm and in gaining new insights in the structure (and hardness) of SAT instances.
Unable to display preview. Download preview PDF.
- 1.Sinz, C.: Visualizing the internal structure of SAT instances (preliminary report). In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)Google Scholar
- 4.Aspvall, M., Plass, M., Tarjan, R.: A linear-time algorithm for testing the trurh of certain quantified boolean formulas. Information Processing Letters 8 (1979)Google Scholar
- 6.Slater, A.: Visualisation of satisfiability problems using connected graphs (2004), http://rsise.anu.edu.au/~andrews/problem2graph