Reasoning with ordered binary decision diagrams

DOI10.1007/3-540-40996-3_11MaRDI QIDQ4472485zbMATH OpenFDO

Authors Takashi Horiyama, Toshihide Ibaraki

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690120.htm

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)

Recommendations

• Reasoning with ordered binary decision diagrams
• Ordered binary decision diagrams as knowledge-bases
• Ordered binary decision diagrams as knowledge-bases
• Reasoning with models
• Ordered binary decision diagrams and the Davis-Putnam procedure

Cited in

(5)

• Ordered binary decision diagrams as knowledge-bases
• Reasoning with ordered binary decision diagrams
• OBDD-based reasoning for terminological cycles of the description logic \(\mathcal{EL}\)
• Ordered binary decision diagrams as knowledge-bases
• Ordered binary decision diagrams and minimal trellises

This page was built for publication: Reasoning with ordered binary decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472485)