From graph transformation units via minisat to GrGen.NET

Authors:
Marcus Ermler;Hans-Jörg Kreowski;Sabine Kuske;Caroline von Totth
Affiliations:
Department of Computer Science, University of Bremen, Bremen, Germany;Department of Computer Science, University of Bremen, Bremen, Germany;Department of Computer Science, University of Bremen, Bremen, Germany;Department of Computer Science, University of Bremen, Bremen, Germany
Venue:
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Year:
2011

Citing 10
Cited 0

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

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)
Graph Transformation Units --- An Overview

Concurrency, Graphs and Models
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Scheduling Algorithms

Scheduling Algorithms
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Graph transformation units guided by a sat solver

ICGT'10 Proceedings of the 5th international conference on Graph transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

In logistics and other application areas, one faces many intractable and NP-hard problems like scheduling, routing, packing, planning, and various kinds of optimization. Many of them can nicely and correctly be modeled by means of graph transformation. But a graph transformation engine fails to run the solutions properly because it does not have any mechanisms to overcome or circumvent the intractability. In this paper, we propose to combine the graph transformation engine GrGen.NET with the SAT solver MiniSat to improve the situation. SAT solvers have proved to run efficiently in many cases in the area of chip design and verification. We want to take these positive experiences up and to use the SAT solver as a tentative experiment for assisting the graph transformation engine in finding solutions to NP-hard problems.