Research Project: G12 Constraint Programming Platform
The images on this page are produced by the G12 visualisation toolkit. They show static views of constraint graphs revealing the structure of SAT-like realisations of problems in AI planning and bounded model checking. Each vertex is a variable, and two variables are joined by an edge if they co-occur in at least one constraint. The constraint graph viewer in G12 uses a quasi-physical force-directed layout: we imagine that all vertices repel each other like similarly charged particles, with a force that obeys an inverse square law, and that edges pull adjacent vertices together with a force linear in the length of the edge, like springs with a rest length of zero. While the examples shown here are 2-dimensional, so as to show a maximum of vertices without overlap, in some cases 3D layouts are also also useful and intuitive. Dr J K Slaney Phone (Aus.): (026) 125 8607 Automated Reasoning Project Phone (Int.): +61 26 125 8607 Australian National University Fax (Aus.): (026) 125 8651 Canberra, ACT, 0200, AUSTRALIA Fax (Int.): +61 26 125 8651John.Slaney@anu.edu.au |