{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:52Z","timestamp":1740123832422,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:00Z","timestamp":1702684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:00Z","timestamp":1702684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["19-19463S"],"award-info":[{"award-number":["19-19463S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10472-023-09915-5","type":"journal-article","created":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T05:02:07Z","timestamp":1702702927000},"page":"1097-1112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A faster implementation of EQ and SE queries for switch-list representations"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6325-0897","authenticated-orcid":false,"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9995-4266","authenticated-orcid":false,"given":"James","family":"Weigle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Le Berre, D., Marquis, P., Mengel, S., Wallon, R.: Pseudo-Boolean constraints from a knowledge representation perspective. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 1891\u20131897. IJCAI, https:\/\/www.ijcai.org\/ (2018)","key":"9915_CR1","DOI":"10.24963\/ijcai.2018\/261"},{"key":"9915_CR2","first-page":"451","volume":"69","author":"O \u010cepek","year":"2020","unstructured":"\u010cepek, O., Chrom\u00fd, M.: Properties of switch-list representations of boolean functions. J. Artif. Intel. Res. 69, 451\u2013479 (2020)","journal-title":"J. Artif. Intel. Res."},{"doi-asserted-by":"crossref","unstructured":"\u010cepek, O., Chrom\u00fd, M.: Switch-List Representations in a Knowledge Compilation Map. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 1651\u20131657. IJCAI, https:\/\/www.ijcai.org\/ (2020)","key":"9915_CR3","DOI":"10.24963\/ijcai.2020\/229"},{"key":"9915_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2016.11.002","volume":"23","author":"O \u010cepek","year":"2017","unstructured":"\u010cepek, O., Hu\u0161ek, R.: Recognition of tractable DNFs representable by a constant number of intervals. Discret. Optim. 23, 1\u201319 (2017)","journal-title":"Discret. Optim."},{"key":"9915_CR5","first-page":"229","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A Knowledge Compilation Map. J. Artif. Intel. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intel. Res."},{"unstructured":"\u010cepek,O.; Weigle,J.: A direct equivalence-testing algorithm for SLRs. Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM 2022), Fort Lauderdale, USA, January 3-5, 2022","key":"9915_CR6"},{"key":"9915_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/SAT-220002","volume":"13","author":"S Mengel","year":"2022","unstructured":"Mengel, S.: No efficient disjunction or conjunction of switch-lists. J. Satisfiability Boolean Model. Comput. 13, 1\u20134 (2022)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"9915_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.dam.2004.08.009","volume":"149","author":"B Schieber","year":"2005","unstructured":"Schieber, B., Geist, D., Zaks, A.: Computing the minimum DNF representation of Boolean functions defined by intervals. Discret. Appl. Math. 149, 154\u2013173 (2005)","journal-title":"Discret. Appl. Math."},{"key":"9915_CR9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching programs and binary decision diagrams: Theory and Applications","author":"I Wegener","year":"2000","unstructured":"Wegener, I.: Branching programs and binary decision diagrams: Theory and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09915-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-023-09915-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09915-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T02:07:45Z","timestamp":1728871665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-023-09915-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,16]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9915"],"URL":"https:\/\/doi.org\/10.1007\/s10472-023-09915-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2023,12,16]]},"assertion":[{"value":"27 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}