DPvis: a tool to visualize the structure of SAT instances

Authors:
Carsten Sinz;Edda-Maria Dieringer
Affiliations:
Symbolic Computation Group, WSI for Computer Science, University of Tübingen, Tübingen, Germany;Symbolic Computation Group, WSI for Computer Science, University of Tübingen, Tübingen, Germany
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 5
Cited 3

Graph drawing by force-directed placement

Software—Practice & Experience
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Partitioning methods for satisfiability testing on large formulas

Information and Computation
Resolution versus Search: Two Strategies for SAT

Journal of Automated Reasoning
Backbone fragility and the local search cost peak

Journal of Artificial Intelligence Research

Visualizing SAT Instances and Runs of the DPLL Algorithm

Journal of Automated Reasoning
SAT graph-based representation: A new perspective

Journal of Algorithms
iSat: structure visualization for SAT problems

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.