Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <sat_inprocessing.h>
Public Member Functions | |
BoundedVariableElimination (Model *model) | |
bool | DoOneRound (bool log_info) |
Definition at line 317 of file sat_inprocessing.h.
|
inlineexplicit |
Definition at line 319 of file sat_inprocessing.h.
bool operations_research::sat::BoundedVariableElimination::DoOneRound | ( | bool | log_info | ) |
We ignore redundant clause. This shouldn't cause any validity issue.
Make sure we fix variables first if needed. Note that because new binary clause might appear when we fix variables, we need a loop here.
Currently we never re-add top if we just processed it.
Remove all redundant clause containing a removed literal. This avoid to re-introduce a removed literal via conflict learning.
Release some memory.
Definition at line 1156 of file sat_inprocessing.cc.