Learning a Propagation Complete Formula
Author:
- 10 June 2022
- book chapter
- Published by Springer Nature
- p. 214-231
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Complexity issues related to propagation completenessArtificial Intelligence, 2013
- Automated Reencoding of Boolean FormulasLecture Notes in Computer Science, 2013
- Knowledge Compilation with Empowerment2012
- On the power of clause-learning SAT solvers as resolution enginesArtificial Intelligence, 2011
- Exclusive and essential sets of implicates of Boolean functionsDiscrete Applied Mathematics, 2010
- An Extensible SAT-solver2004
- Prime implicant computation using satisfiability algorithms2002
- Learning conjunctions of Horn clausesMachine Learning, 1992
- COSMOS: a compiled simulator for MOS circuits1987
- Minimum Covers in Relational Database ModelJournal of the ACM, 1980