Ordered binary decision diagrams as knowledge-bases

DOI10.1016/S0004-3702(02)00119-4zbMath0995.68105OpenAlexW1969046334MaRDI QIDQ1605409

Toshihide Ibaraki, Takashi Horiyama

Publication date: 15 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00119-4

zbMATH Keywords

knowledge representationrecognition problemsHorn functionsordered binary decision diagrams (OBDDs)sutomated reasoningunate functions

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items

Reasoning with ordered binary decision diagrams ⋮ Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram ⋮ Experimental comparison of decomposition methods for systems of Boolean function ⋮ Minimization of binary decision diagrams for systems of incompletely defined Boolean functions ⋮ Translation among CNFs, characteristic models and ordered binary decision diagrams

Uses Software

• ROBDD

Cites Work

• Structure identification in relational data
• OBDDs of a monotone function and its prime implicants
• Horn approximations of empirical data
• Reasoning with models
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• A theory of the learnable
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• The complexity of logic-based abduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item