{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T19:56:46Z","timestamp":1768161406253,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032159809","type":"print"},{"value":"9783032159816","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15981-6_9","type":"book-chapter","created":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:35Z","timestamp":1768151615000},"page":"143-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Prolog to\u00a0Translate Set Theory and\u00a0B to\u00a0SAT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4595-1518","authenticated-orcid":false,"given":"Michael","family":"Leuschel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abrial, J.-R.: The B-Book. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511624162"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abrial, J.-R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195881"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45648-1_13","volume-title":"ZB 2002:Formal Specification and Development in Z and B","author":"J-R Abrial","year":"2002","unstructured":"Abrial, J.-R., Mussat, L.: On using conditional definitions in formal theories. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002. LNCS, vol. 2272, pp. 242\u2013269. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45648-1_13"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1017\/S1471068417000138","volume":"17","author":"M Banbara","year":"2017","unstructured":"Banbara, M., Kaufmann, B., Ostrowski, M., Schaub, T.: Clingcon: the next generation. Theory Pract. Log. Program. 17(4), 408\u2013461 (2017)","journal-title":"Theory Pract. Log. Program."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Behm, P., Burdy, L., Meynadier, J.: Well defined B. In: Bert, D. (ed.) Proceedings B 1998. LNCS, vol. 1393, pp. 29\u201345. Springer (1998)","DOI":"10.1007\/BFb0053354"},{"key":"9_CR6","unstructured":"Carbonnelle, P., Vandevelde, S., Vennekens, J., Denecker, M.: IDP-Z3: a reasoning engine for FO(.). CoRR, abs\/2202.00343 (2022)"},{"issue":"1\u20132","key":"9_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S1471068411000482","volume":"12","author":"M Carlsson","year":"2012","unstructured":"Carlsson, M., Mildner, P.: SICStus prolog - the first 25 years. Theory Pract. Log. Program. 12(1\u20132), 35\u201366 (2012)","journal-title":"Theory Pract. Log. Program."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Glaser, H.G., Hartel, P.H., Kuchen, H. (eds.) Proceedings PLILP 1997. LNCS, vol. 1292, pp. 191\u2013206. Springer (1997)","DOI":"10.1007\/BFb0033845"},{"key":"9_CR9","unstructured":"ClearSy. Atelier B, User and Reference Manuals. Aix-en-Provence, France (2009). http:\/\/www.atelierb.eu\/"},{"issue":"5\u20136","key":"9_CR10","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1017\/S1471068419000231","volume":"19","author":"B Cuteri","year":"2019","unstructured":"Cuteri, B., Dodaro, C., Ricca, F., Sch\u00fcller, P.: Partial compilation of ASP programs. Theory Pract. Log. Program. 19(5\u20136), 857\u2013873 (2019)","journal-title":"Theory Pract. Log. Program."},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1017\/S1471068421000351","volume":"21","author":"KV Dessel","year":"2021","unstructured":"Dessel, K.V., Devriendt, J., Vennekens, J.: Folasp: Fo($$\\cdot $$) as input language for answer set solvers. Theory Pract. Log. Program. 21(6), 785\u2013801 (2021)","journal-title":"Theory Pract. Log. Program."},{"key":"9_CR12","unstructured":"Dudeney, H.E.: Amusements in Mathematics (1917). https:\/\/www.gutenberg.org\/ebooks\/16713"},{"key":"9_CR13","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Carro, M., King, A., Saeedloei, N., Vos, M.D. (eds.) Technical Communications ICLP 2016. OASIcs, vol. 52, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Log. Program."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S1574-6526(06)80014-3","volume":"2","author":"IP Gent","year":"2006","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.-F.: Symmetry in constraint programming. Found. Artif. Intell. 2, 329\u2013376 (2006)","journal-title":"Found. Artif. Intell."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/505145.505149","volume":"11","author":"D Jackson","year":"2002","unstructured":"Jackson, D.: Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol. 11, 256\u2013290 (2002)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.scico.2017.08.013","volume":"158","author":"S Krings","year":"2018","unstructured":"Krings, S., Leuschel, M.: Proof assisted bounded and unbounded symbolic model checking of software and system models. Sci. Comput. Program. 158, 41\u201363 (2018)","journal-title":"Sci. Comput. Program."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-319-73305-0_5","volume-title":"Practical Aspects of Declarative Languages","author":"S Krings","year":"2018","unstructured":"Krings, S., Leuschel, M., K\u00f6rner, P., Hallerstede, S., Hasanagi\u0107, M.: Three is a crowd: SAT, SMT and CLP on a chessboard. In: Calimeri, F., Hamlen, K., Leone, N. (eds.) PADL 2018. LNCS, vol. 10702, pp. 63\u201379. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73305-0_5"},{"key":"9_CR19","unstructured":"Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2002)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-63461-2_4","volume-title":"Integrated Formal Methods","author":"M Leuschel","year":"2020","unstructured":"Leuschel, M.: Fast and effective well-definedness checking. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 63\u201381. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_4"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Leuschel, M.: ProB: harnessing the power of Prolog to bring formal models and mathematics to life. In: Warren, D.S., Dahl, V., Eiter, T., Hermenegildo, M.V., Kowalski, R., Rossi, F. (eds.) Prolog: The Next 50 Years. LNCS, vol. 13900, pp. 239\u2013247. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-35254-6_19"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Leuschel, M.: B2SAT: a bare-metal reduction of B to SAT. In: Proceedings FM 2024. LNCS, vol. 14934, pp. 122\u2013139. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-71177-0_9"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-007-0063-9","volume":"10","author":"M Leuschel","year":"2008","unstructured":"Leuschel, M., Butler, M.J.: ProB: an automated analysis toolset for the B method. STTT 10(2), 185\u2013203 (2008)","journal-title":"STTT"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-45648-1_8","volume-title":"ZB 2002:Formal Specification and Development in Z and B","author":"L Mikhailov","year":"2002","unstructured":"Mikhailov, L., Butler, M.: An approach to combining B and alloy. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002. LNCS, vol. 2272, pp. 140\u2013161. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45648-1_8"},{"issue":"3\u20134","key":"9_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-32759-9_31","volume-title":"FM 2012: Formal Methods","author":"D Plagge","year":"2012","unstructured":"Plagge, D., Leuschel, M.: Validating B,Z and TLA\u2009+\u2009 using ProB\u00a0and kodkod. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 372\u2013386. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_31"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/s10009-022-00682-y","volume":"24","author":"J Schmidt","year":"2022","unstructured":"Schmidt, J., Leuschel, M.: SMT solving for the validation of B and event-b models. Int. J. Softw. Tools Technol. Transf. 24(6), 1043\u20131077 (2022)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"9_CR28","unstructured":"Spivey, J.M.: The Z Notation: a reference manual. Prentice-Hall (1992). https:\/\/github.com\/Spivoxity\/zrm"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-71209-1_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Torlak","year":"2007","unstructured":"Torlak, E., Jackson, D.: Kodkod: a relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632\u2013647. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_49"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"T Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441\u2013456. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_32"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1613\/jair.2980","volume":"38","author":"J Wittocx","year":"2010","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: Grounding fo and fo(id) with bounds. J. Artif. Intell. Res. (JAIR) 38, 223\u2013269 (2010)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, N.: Modeling and solving graph synthesis problems using sat-encoded reachability constraints in picat. In: Formisano, A., et al. (eds.) Proceedings ICLP 2021. EPTCS, vol. 345, pp. 165\u2013178 (2021)","DOI":"10.4204\/EPTCS.345.30"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15981-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:40Z","timestamp":1768151620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15981-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032159809","9783032159816"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15981-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl26.sigplan.org\/home\/PADL-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}