Query Learning Algorithm for Ordered Multi-Terminal Binary Decision Diagrams

03/03/2023
by   Atsuyoshi Nakamura, et al.
0

We propose a query learning algorithm for ordered multi-terminal binary decision diagrams (OMTBDDs) using at most n equivalence and 2n(llog_2 m⌉+ 3n) membership queries by extending the algorithm for ordered binary decision diagrams (OBDDs). Tightness of our upper bounds is checked in our experiments using synthetically generated target OMTBDDs. Possibility of applying our algorithm to classification problems is also indicated in our other experiments using datasets of UCI Machine Learning Repository.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2022

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams

This paper presents a new compressed representation of Boolean functions...
research
04/05/2020

On Tractable Representations of Binary Neural Networks

We consider the compilation of a binary neural network's decision functi...
research
01/20/2022

Belief Revision in Sentential Decision Diagrams

Belief revision is the task of modifying a knowledge base when new infor...
research
06/14/2019

Drawing Order Diagrams Through Two-Dimension Extension

Order diagrams are an important tool to visualize the complex structure ...
research
08/14/2012

Ordered AND, OR-Decomposition and Binary-Decision Diagram

In the context of knowledge compilation (KC), we study the effect of aug...
research
02/08/2018

A New Algorithmic Decision for Catergorical Syllogisms via Caroll's Diagrams

In this work, we give an algorithm by using Carroll diagrammatic method ...
research
03/16/2011

Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach

Knowledge compilation is an approach to tackle the computational intract...

Please sign up or login with your details

Forgot password? Click here to reset