Reasoning with ordered binary decision diagrams
From MaRDI portal
Recommendations
Cites work
- Binary Decision Diagrams
- Graph-Based Algorithms for Boolean Function Manipulation
- Horn approximations of empirical data
- scientific article; zbMATH DE number 67477 (Why is no real title available?)
- scientific article; zbMATH DE number 1354130 (Why is no real title available?)
- scientific article; zbMATH DE number 910866 (Why is no real title available?)
- scientific article; zbMATH DE number 3275548 (Why is no real title available?)
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Ordered binary decision diagrams as knowledge-bases
- Reasoning with models
- Support set selection for abductive and default reasoning
- The complexity of logic-based abduction
- The complexity of theorem-proving procedures
Cited in
(8)- Ordered binary decision diagrams as knowledge-bases
- Implementing semantic merging operators using binary decision diagrams
- What makes propositional abduction tractable
- Reasoning with models
- scientific article; zbMATH DE number 2080240 (Why is no real title available?)
- scientific article; zbMATH DE number 1522923 (Why is no real title available?)
- Ordered binary decision diagrams and minimal trellises
- The complexity of reasoning with FODD and GFODD
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 Q1878409)