Boolean Nearest Neighbor Language in the Knowledge Compilation Map
Ond\v{r}ej \v{C}epek, Jelena Gli\v{s}i\'c

TL;DR
This paper investigates the Boolean Nearest Neighbor (BNN) representation of Boolean functions, analyzing its placement in the Knowledge Compilation Map and comparing its succinctness and computational complexity to other standard languages.
Contribution
It establishes the position of BNN in the KCM, compares its succinctness with other languages, and analyzes the complexity of queries and transformations for BNN.
Findings
BNN's position in the Knowledge Compilation Map is determined.
Comparative analysis of BNN's succinctness with standard languages.
Complexity results for queries and transformations on BNN representations.
Abstract
The Boolean Nearest Neighbor (BNN) representation of Boolean functions was recently introduced by Hajnal, Liu and Turan. A BNN representation of is a pair of sets of Boolean vectors (called positive and negative prototypes) where for every positive prototype , for all every negative prototype , and the value for is determined by the type of the closest prototype. The main aim of this paper is to determine the position of the BNN language in the Knowledge Compilation Map (KCM). To this end, we derive results which compare the succinctness of the BNN language to several standard languages from KCM, and determine the complexity status of most standard queries and transformations for BNN inputs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Data Mining Algorithms and Applications · Rough Sets and Fuzzy Logic
