{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:07:24Z","timestamp":1773324444077,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642159275","type":"print"},{"value":"9783642159282","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_3","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"27-42","source":"Crossref","is-referenced-by-count":7,"title":["Graph Transformation Units Guided by a SAT Solver"],"prefix":"10.1007","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Wille","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_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: Design Automation Conf., pp. 317\u2013320 (1999)","DOI":"10.21236\/ADA360973"},{"key":"3_CR2","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"3_CR3","unstructured":"Carnegie Mellon University, Graph Coloring Instances, http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html:"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. Third ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"3_CR5","series-title":"Foundations","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Ehrig, H., Heckel, R., L\u00f6we, M., Montanari, U., Rossi, F.: Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"3_CR6","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":"3_CR7","volume-title":"Fundamentals of Algebraic Graph Transformation","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G. (eds.): Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)"},{"key":"3_CR8","series-title":"Series on Integrated Circuits and Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-69167-1","volume-title":"SAT-Based Scalable Formal Verification Solutions","author":"M. Ganai","year":"2007","unstructured":"Ganai, M., Gupta, A.: SAT-Based Scalable Formal Verification Solutions. Series on Integrated Circuits and Systems. Springer, Heidelberg (2007)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.entcs.2007.08.028","volume":"195","author":"K. H\u00f6lscher","year":"2008","unstructured":"H\u00f6lscher, K., Klempien-Hinrichs, R., Knirsch, P.: Undecidable control conditions in graph transformation units. Electronic Notes in Theoretical Computer Science\u00a0195, 95\u2013111 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"6","key":"3_CR10","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":"3_CR11","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":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-540-46464-8_23","volume-title":"Theory and Application of Graph Transformations","author":"S. Kuske","year":"2000","unstructured":"Kuske, S.: More about control conditions for transformation units. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 323\u2013337. Springer, Heidelberg (2000)"},{"key":"3_CR13","series-title":"Concurrency, Parallelism, and Distribution","first-page":"1","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"I. Litovski","year":"1999","unstructured":"Litovski, I., M\u00e9tivier, Y., Sopena, \u00c9.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol.\u00a03, pp. 1\u201356. World Scientific, Singapore (1999)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-74970-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"J. Marques-Silva","year":"2007","unstructured":"Marques-Silva, J., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 483\u2013497. Springer, Heidelberg (2007)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Kuhlmann, M., Gogolla, M., Drechsler, R.: Verifying UML\/OCL models using Boolean satisfiability. In: Design, Automation and Test in Europe, pp. 1341\u20131344 (2010)","DOI":"10.1109\/DATE.2010.5457017"},{"key":"#cr-split#-3_CR16.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. 115???125 (1968);","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"#cr-split#-3_CR16.2","doi-asserted-by":"crossref","unstructured":"Reprinted in: Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning, vol.??2, pp. 466???483. Springer, Berlin (1983)","DOI":"10.1007\/978-3-642-81952-0"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:47Z","timestamp":1606185767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}