iSat: structure visualization for SAT problems

Authors:
Ezequiel Orbe;Carlos Areces;Gabriel Infante-López
Affiliations:
Grupo de Procesamiento de Lenguaje Natural FaMAF, Universidad Nacional de Córdoba, Argentina;Grupo de Procesamiento de Lenguaje Natural FaMAF, Universidad Nacional de Córdoba, Argentina;Grupo de Procesamiento de Lenguaje Natural FaMAF, Universidad Nacional de Córdoba, Argentina
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 6
Cited 0

Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Robust Search Algorithms for Test Pattern Generation

FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
DPvis: a tool to visualize the structure of SAT instances

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present iSat, a Python command line tool to analyze and find structure in propositional satisfiability problems. iSat offers an interactive shell to control propositional SAT solvers and generate graph representations of the internal structure of the search space explored by them for visualization, with the final aim of providing a unified environment for propositional solving experimentation. iSat was designed to enable simple integration of both new SAT solvers and new visualization graphs and statistics with a minimum of coding overhead.