Skip to main navigation Skip to search Skip to main content

Symbolic Learning and Generalisation of Boolean Logic Minimisation via Ternary Weight Inference

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Downloads (Pure)

Abstract

We present a novel, interpretable approach for Boolean logic minimisation based on symbolic pattern recognition and discrete optimisation with ternary weights. Our framework constructs a compact set of simplifiable logic bases, discovered through symmetry, Hamming distance heuristics, and canonical truth table analysis. We train these bases using a guided ternary update algorithm that adaptively flips weights to minimise error on Boolean expressions represented in multi-hot symbolic form. The resulting ternary weight matrix W can simplify any Boolean function through a lightweight inference process based on symbolic decomposition. Our method achieves 100% accurate minimisation for all 3-, 4-, 5-, and 6-variable logic functions across exhaustive and large-scale random validation datasets, using no gradient descent, SAT solvers, or external heuristics. This work demonstrates that symbolic Boolean generalisation is not only feasible but also efficient, interpretable, and extensible.
Original languageEnglish
Title of host publicationInternational Conference on Artificial Intelligence, Computer, Data Sciences, and Applications, ACDSA 2026
Place of PublicationPiscataway, NJ, USA
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)979-8-3315-7191-7
ISBN (Print)979-8-3315-7192-4
DOIs
Publication statusPublished - 16 Apr 2026

Publication series

NameInternational Conference on Artificial Intelligence, Computer, Data Sciences, and Applications, ACDSA 2026

Keywords

  • minimisation, synthesis

Cite this