Reasoning with ordered binary decision diagrams
From MaRDI portal
Publication:1878409
DOI10.1016/j.dam.2004.02.002zbMath1077.68100OpenAlexW2053451141MaRDI QIDQ1878409
Takashi Horiyama, Toshihide Ibaraki
Publication date: 19 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.02.002
Automated reasoningAbductionKnowledge representationHorn functionsDeductionOrdered binary decision diagrams (OBDDs)
Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items
Implementing semantic merging operators using binary decision diagrams ⋮ What makes propositional abduction tractable
Uses Software
Cites Work
- Ordered binary decision diagrams as knowledge-bases
- Horn approximations of empirical data
- Support set selection for abductive and default reasoning
- Reasoning with models
- 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
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item