Dualization of Boolean functions using ternary decision diagrams

DOI10.1007/s10472-016-9520-zzbMath1420.68198OpenAlexW2402768459MaRDI QIDQ513353

Takahisa Toda

Publication date: 6 March 2017

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-016-9520-z

zbMATH Keywords

compressiondualizationall-solutions solverternary decision diagram

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean functions (06E30)

Related Items

Implementing Efficient All Solutions SAT Solvers

Uses Software

• JBool
• clasp
• sharpSAT

Cites Work

• Computational aspects of monotone dualization: a brief survey
• A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
• Zero-suppressed BDDs and their applications
• Directed hypergraphs and applications
• Efficient algorithms for dualizing large-scale hypergraphs
• Graph-Based Algorithms for Boolean Function Manipulation
• Branching Programs and Binary Decision Diagrams
• Conflict-Driven Answer Set Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item