{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:24:01Z","timestamp":1773883441183,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":0,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["864075"],"award-info":[{"award-number":["864075"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["101008233"],"award-info":[{"award-number":["101008233"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["NWA.1160.18.238"],"award-info":[{"award-number":["NWA.1160.18.238"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,18]]},"DOI":"10.1145\/3623503.3623535","type":"proceedings-article","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T14:34:51Z","timestamp":1697726091000},"page":"48-59","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Queries for Boolean Fault Tree Logic via Quantified SAT"],"prefix":"10.1145","author":[{"given":"Caz","family":"Saaltink","sequence":"first","affiliation":[{"name":"University of Twente, Enschede, Netherlands"}]},{"given":"Stefano M.","family":"Nicoletti","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, Netherlands"}]},{"given":"Matthias","family":"Volk","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, Netherlands"}]},{"given":"Ernst Moritz","family":"Hahn","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, Netherlands"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[{"name":"University of Twente, Enschede, Netherlands \/ Radboud University, Nijmegen, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2023,10,19]]},"event":{"name":"FTSCS '23: 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems","location":"Cascais Portugal","acronym":"FTSCS '23","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"]},"container-title":["Proceedings of the 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3623503.3623535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3623503.3623535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:51:01Z","timestamp":1750287061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3623503.3623535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":0,"alternative-id":["10.1145\/3623503.3623535","10.1145\/3623503"],"URL":"https:\/\/doi.org\/10.1145\/3623503.3623535","relation":{},"subject":[],"published":{"date-parts":[[2023,10,18]]},"assertion":[{"value":"2023-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}