{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:01:46Z","timestamp":1773324106229,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341755","type":"print"},{"value":"9783642341762","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34176-2_14","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:59Z","timestamp":1349071019000},"page":"153-168","source":"Crossref","is-referenced-by-count":4,"title":["From Graph Transformation Units via MiniSat to GrGen.NET"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Ermler","sequence":"first","affiliation":[]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[]},{"given":"Caroline","family":"von Totth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Irwin, M.J. (ed.) Proc. of the 36th Annual ACM\/IEEE Design Automation Conference, pp. 317\u2013320. ACM (1999)","DOI":"10.1145\/309847.309942"},{"key":"14_CR2","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"key":"14_CR3","unstructured":"Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J. (eds.): Handbook on Scheduling: From Theory to Applications. Springer (2007)"},{"key":"14_CR4","unstructured":"Brucker, P.: Scheduling Algorithms. Springer (2007)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"14_CR6","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer (2006)"},{"key":"14_CR7","unstructured":"Funsat: \n                    \n                      http:\/\/hackage.haskell.org\/package\/funsat-0.6.0\n                    \n                    \n                   (accessed August 26, 2011)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ganai, M., Gupta, A.: SAT-Based Scalable Formal Verification Solutions. Series on Integrated Circuits and Systems. Springer (2007)","DOI":"10.1007\/978-0-387-69167-1"},{"key":"14_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-89020-1_38","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"R. Gei\u00df","year":"2008","unstructured":"Gei\u00df, R., Kroll, M.: GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol.\u00a05088, pp. 568\u2013569. Springer, Heidelberg (2008)"},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s001659970005","volume":"11","author":"H.J. Kreowski","year":"1999","unstructured":"Kreowski, H.J., Kuske, S.: Graph transformation units with interleaving semantics. Formal Aspects of Computing\u00a011(6), 690\u2013723 (1999)","journal-title":"Formal Aspects of Computing"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-68679-8_5","volume-title":"Concurrency, Graphs and Models","author":"H.-J. Kreowski","year":"2008","unstructured":"Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph Transformation Units \u2013 An Overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol.\u00a05065, pp. 57\u201375. Springer, Heidelberg (2008)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-15928-2_3","volume-title":"Graph Transformations","author":"H.-J. Kreowski","year":"2010","unstructured":"Kreowski, H.-J., Kuske, S., Wille, R.: Graph Transformation Units Guided by a SAT Solver. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol.\u00a06372, pp. 27\u201342. Springer, Heidelberg (2010)"},{"key":"14_CR14","unstructured":"Limboole (2011), \n                    \n                      http:\/\/fmv.jku.at\/limboole\/\n                    \n                    \n                   (accessed August 26, 2011)"},{"key":"14_CR15","unstructured":"Logic2CNF (2011), \n                    \n                      http:\/\/projects.cs.kent.ac.uk\/projects\/logic2cnf\/trac\/\n                    \n                    \n                   (accessed August 26, 2011)"},{"key":"14_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, USA (2006)"},{"key":"14_CR17","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer (2008)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations. World Scientific (1997)","DOI":"10.1142\/9789812384720"},{"key":"14_CR19","unstructured":"Sugar (2011), \n                    \n                      http:\/\/bach.istc.kobe-u.ac.jp\/sugar\/\n                    \n                    \n                   (accessed August 26, 2011)"},{"key":"#cr-split#-14_CR20.1","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of derivation in propositional calculus. In: Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 466-483 (1968)","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"#cr-split#-14_CR20.2","doi-asserted-by":"crossref","unstructured":"(reprinted in: Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning, vol.\u00a02, pp. 466-483. Springer (1983))","DOI":"10.1007\/978-3-642-81955-1"}],"container-title":["Lecture Notes in Computer Science","Applications of Graph Transformations with Industrial Relevance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34176-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T01:47:01Z","timestamp":1557280021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34176-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341755","9783642341762"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34176-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}