[[["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."],[[["\u003cp\u003eThis documentation details the implementation of a pure SAT presolver based on the paper "Effective Preprocessing in SAT through Variable and Clause Elimination".\u003c/p\u003e\n"],["\u003cp\u003eThe presolver utilizes techniques for variable and clause elimination to simplify SAT problems before solving.\u003c/p\u003e\n"],["\u003cp\u003eTwo main classes are involved: \u003ccode\u003eSatPostsolver\u003c/code\u003e and \u003ccode\u003eSatPresolver\u003c/code\u003e, with links provided for further exploration.\u003c/p\u003e\n"]]],["The document outlines the implementation of a pure SAT presolver, based on the \"Effective Preprocessing in SAT through Variable and Clause Elimination\" paper by Een and Biere (SAT 2005). It details the use of a `SatPresolver` class for preprocessing and a `SatPostsolver` class. The core functionality centers on simplifying SAT problems by eliminating variables and clauses as described in the mentioned research paper.\n"],null,[]]
