Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
More About Control Conditions for Transformation Units
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
SAT-Based Scalable Formal Verification Solutions (Series on Integrated Circuits and Systems)
SAT-Based Scalable Formal Verification Solutions (Series on Integrated Circuits and Systems)
Undecidable Control Conditions in Graph Transformation Units
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph Transformation Units --- An Overview
Concurrency, Graphs and Models
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Towards robust CNF encodings of cardinality constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Verifying UML/OCL models using Boolean satisfiability
Proceedings of the Conference on Design, Automation and Test in Europe
From graph transformation units via minisat to GrGen.NET
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
| Hi-index | 0.00 |
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.