uwescience/datalogcompiler — pull request #117 by bmyerz (2014-02-19 02:23:08+00:00)
Title: heuristic try to break cycles with != edges when building logical RA

note that current approach is not efficient because it checks
all cycle edges for a != before giving up. Then again iterative
cycle finding is not as efficient as MST