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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ermler, M., Kreowski, H. J., Kuske, S., & Von Totth, C. (2012). From graph transformation units via MiniSat to GrGen.NET. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7233 LNCS, pp. 153–168). https://doi.org/10.1007/978-3-642-34176-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
