On CNF formulas irredundant with respect to unit clause propagation.
Petr SavickýPublished in: CoRR (2023)
Keyphrases
- cnf formula
- np complete
- max sat
- sat problem
- knowledge compilation
- conjunctive normal form
- davis putnam
- satisfiability problem
- randomly generated
- neural network
- constraint satisfaction
- propositional formulas
- search algorithm
- constraint satisfaction problems
- knowledge acquisition
- simulated annealing
- scheduling problem
- np hard