Visualisation of satisfiability using the logic engine

Authors:
Colin Murray;Carsten Friedrich
Affiliations:
The University of Sydney, Australia;The University of Sydney, Australia
Venue:
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Year:
2005

Citing 8
Cited 0

The complexity of minimizing wire lengths in VLSI layouts

Information Processing Letters
The realization problem for Euclidean minimum spanning trees is NP-hard

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
The logic engine and the realization problem for nearest neighbor graphs

Theoretical Computer Science - Special issue on theoretical computer science in Australia and New Zealand
A Survey of Combinatorial Gray Codes

SIAM Review
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Strength of Weak Proximity

GD '95 Proceedings of the Symposium on Graph Drawing
The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
The three dimensional logic engine

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Logic Engine is an artificial, physical construct that can encode instances of the NAE3SAT problem, a variation of satisfiability. It thus provides an intuitive way of visualizing these normally abstract problems. We introduce a visualisation of the logic engine that is customisable and freely available. Our implementation is available on the web from http://www.it.usyd.edu.au/~carsten/LogicEngine/