Graph transformation units guided by a SAT solver

Graph transformation units are rule-based devices to model graph algorithms, graph processes, and the dynamics of systems the states of which are represented by graphs. Given a graph, various rules are applicable at various matches in general, but not any choice leads to a proper result so that one faces the problem of nondeterminism. As countermeasure, graph transformation units provide the generic concept of control conditions which allow one to cut down the nondeterminism and to choose the proper rule applications out of all possible ones. In this paper, we propose an alternative approach. For a special type of graph transformation units including the solution of many NP-complete and NP-hard problems, the successful derivations from initial to terminal graphs are described by propositional formulas. In this way, it becomes possible to use a SAT solver to find out whether there is a successful derivation for some initial graph or not and how it is built up in the positive case.