Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: sat_inprocessing
Note: This documentation is automatically generated.
This file contains the entry point for our presolve/inprocessing code.
TODO(user): for now it is mainly presolve, but the idea is to call these function during the search so they should be as incremental as possible. That is avoid doing work that is not useful because nothing changed or exploring parts that were not done during the last round.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["This documentation outlines the entry point for presolve/inprocessing code in C++."],["The goal is to enable incremental function calls during search, minimizing redundant work."],["Core functionalities include blocked clause simplification, bounded variable elimination, and stamping simplification."]]],["The document outlines C++ code for presolve/inprocessing, designed to be incremental and called during search. Key components include classes for `BlockedClauseSimplifier`, `BoundedVariableElimination`, `Inprocessing`, and `StampingSimplifier`. The goal is to minimize redundant work by avoiding operations that are unnecessary due to lack of changes and by not exploring parts of the code that were previously processed. The current focus is mainly on presolve, with future expansion into inprocessing during the search.\n"]]
