Sciweavers

3 search results - page 1 / 1
» Visualizing the Internal Structure of SAT Instances (Prelimi...
Sort
View
SAT
2004
Springer
85views Hardware» more  SAT 2004»
13 years 10 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
JAR
2007
132views more  JAR 2007»
13 years 4 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
DAGSTUHL
2001
13 years 6 months ago
An Overview of the GXL Graph Exchange Language
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
Andreas Winter, Bernt Kullbach, Volker Riediger