{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:00:10Z","timestamp":1762326010660,"version":"build-2065373602"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>The Boolean Nearest Neighbor (BNN) representation of\n\nBoolean functions was recently introduced by Hajnal, Liu\n\nand Turan. A BNN representation of function f is a pair\n\n(P,N) of sets of Boolean vectors (called positive and\n\nnegative prototypes) where f(x) = 1 for every positive\n\nprototype x \u2208 P, f(x) = 0 for every negative prototype x \u2208\n\nN, and the value f(x) for x  not in (P \u222a N) is determined\n\nby the type of the closest prototype. The main aim of this\n\npaper is to determine the position of the BNN language in\n\nthe Knowledge Compilation Map (KCM). To this end, we settle\n\nthe complexity status of most standard queries and\n\ntransformations (those listed in KCM) for BNN inputs. We\n\nalso compare the succinctness of the BNN language with\n\nseveral languages considered in KCM.<\/jats:p>","DOI":"10.24963\/kr.2025\/24","type":"proceedings-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:44Z","timestamp":1762323044000},"page":"240-249","source":"Crossref","is-referenced-by-count":0,"title":["Boolean Nearest Neighbor Language in the Knowledge Compilation Map"],"prefix":"10.24963","author":[{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[{"name":"Charles University, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelena","family":"Gli\u0161i\u0107","sequence":"additional","affiliation":[{"name":"Charles University, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"22nd International Conference on Principles of Knowledge Representation and Reasoning {KR-2025}","theme":"Artificial Intelligence","location":"Melbourne, Australia","acronym":"KR-2025","number":"22","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"start":{"date-parts":[[2025,11,11]]},"end":{"date-parts":[[2025,11,17]]}},"container-title":["Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:11:01Z","timestamp":1762323061000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2025\/24"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2025\/24","relation":{},"subject":[],"published":{"date-parts":[[2025,11]]}}}