iSat: Structure Visualization for SAT Problems

E. Orbe, C. Areces, and G. Infante López. iSat: Structure Visualization for SAT Problems. In Proceedings of the 18th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-18), Merida, Venezuela, 2012.

Download

[pdf] 

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 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 allow the simple integration of both new provers and new visualizationgraphs and statistics with a minimum of coding overhead.

BibTeX

@InCollection{Orbe2012a,
  author =       "E. Orbe and C. Areces and G. Infante L{\'o}pez",
  booktitle =    "Proceedings of the 18th International Conference on
                 Logic for Programming Artificial Intelligence and
                 Reasoning (LPAR-18)",
  title =        "{iSat}: Structure Visualization for {SAT} Problems",
  year =         "2012",
  address =      "Merida, Venezuela",
  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 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 allow the simple integration of both new
                 provers and new visualizationgraphs and statistics with
                 a minimum of coding overhead.",
  owner =        "areces",
  timestamp =    "2012.02.17",
  ISBN =         "978-3-642-28716-9",
}