mlsanityData to 14 Oct 2026

SATViz: Real-Time Visualization of Clausal Proofs

arXiv 2209.05838 ↗First posted 13 Sep 2022cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Visual layouts of graphs representing SAT instances can highlight the community structure of SAT instances. The community structure of SAT instances has been associated with both instance hardness and known clause quality heuristics. Our tool SATViz visualizes CNF formulas using the variable interaction graph and a force-directed layout algorithm. With SATViz, clause proofs can be animated to continuously highlight variables that occur in a moving window of recently learned clauses. If needed, SATViz can also create new layouts of the variable interaction graph with the adjusted edge weights. In this paper, we describe the structure and feature set of SATViz. We also present some interesting visualizations created with SATViz.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 25 references that are in the map. First posted on arXiv 13 Sep 2022.

Builds on

2 of 25 references.

References · 2

  1. 2016Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquercited by 23
  2. 2016The DRAT format and DRAT-trim checkercited by 3

Built on by

Not cited yet.