Translation among CNFs, characteristic models and ordered binary decision diagrams

DOI10.1016/S0020-0190(02)00374-5zbMath1173.68719OpenAlexW2077190531MaRDI QIDQ1007523

Takashi Horiyama, Toshihide Ibaraki

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00374-5

zbMATH Keywords

algorithmsHorn functioncharacteristic modelordered binary decision diagram (OBDD)conjunctive normal form (CNF)

Mathematics Subject Classification ID

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

Uses Software

• ROBDD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning conjunctions of Horn clauses
• Ordered binary decision diagrams as knowledge-bases
• Horn approximations of empirical data
• Exact learning Boolean functions via the monotone theory
• Complexity of identification and dualization of positive Boolean functions
• Reasoning with models
• Graph-Based Algorithms for Boolean Function Manipulation
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

This page was built for publication: Translation among CNFs, characteristic models and ordered binary decision diagrams