On the role of logical separability in knowledge compilation
From MaRDI portal
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- An exhaustive DPLL algorithm for model counting
- AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
- Conformant planning via symbolic model checking and heuristic search
- Consequence finding algorithms
- Decomposable negation normal form
- Definability for model counting
- Disjunctive closures for knowledge compilation
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1150567 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- Knowledge compilation and theory approximation
- On probabilistic inference by weighted model counting
- On quantifying literals in Boolean logic and its applications to explainable AI
- On sentences which are true of direct unions of algebras
- On the reasons behind decisions
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Planning graph heuristics for belief space search
- Properties of Switch-List Representations of Boolean Functions
- Symmetry-driven decision diagrams for knowledge compilation
- The complexity of the counting constraint satisfaction problem
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
- The language of search
- Theory and Applications of Satisfiability Testing
- Verifying binarized neural networks by Angluin-style learning
- What's hard about Boolean functional synthesis?
This page was built for publication: On the role of logical separability in knowledge compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494362)
