Minimal working implementation of attributed graphs.

Involves: implementation based on Symbolic Graphs, with a fixed data algebra of integers, booleans and strings; interop with AGG; Critical Pair Analysis; use of SMT solvers to handle attributes.