Knowledge compilation with empowerment
From MaRDI portal
Recommendations
Cites work
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Encodings of the Sequence Constraint
- GAC Via Unit Propagation
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- On the power of clause-learning SAT solvers as resolution engines
- Preprocessing of intractable problems
- Short proofs are narrow—resolution made simple
Cited in
(13)- Approximately propagation complete and conflict propagating constraint encodings
- Propagation complete encodings of smooth DNNF theories
- Learning a propagation complete formula
- Complexity issues related to propagation completeness
- Generalising unit-refutation completeness and SLUR via nested input resolution
- On preprocessing techniques and their impact on propositional model counting
- Automatic generation of propagation complete SAT encodings
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Generalising and unifying SLUR and unit-refutation completeness
- Disjunctive closures for knowledge compilation
- Bounds on the size of PC and URC formulas
- Tackling universal properties of minimal trap spaces of Boolean networks
- On CNF formulas irredundant with respect to unit clause propagation
This page was built for publication: Knowledge compilation with empowerment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891394)