← Search

Ryoma Onaka

2 accepted papers

2025

An And-Sum Circuit with Signed Edges That Is More Succinct than SDD

AAAI 2025technical

Knowledge compilation is a method of transforming knowledge into a compressed and tractable form for permitting more efficient operations. For Boolean functions, numerous representations have been proposed that enhance succinctness and tractability. In this paper, we introduce a new representation n…

Cited by 0SourcePDFScholar
2025

Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs

AAAI 2025technical

A knowledge compilation map analyzes tractable operations in Boolean function representations and compares their succinctness. This enables the selection of appropriate representations for different applications. In the knowledge compilation map, all representation classes are subsets of the negatio…

Cited by 0SourcePDFScholar