MAXEkSAT (Maximum Excluded K-Satisfiability) is a variant of the Boolean satisfiability problem (SAT) in which the goal is to identify the maximum number of clauses that can be made true by assigning truth values to a set of boolean variables, while ignoring a specified number of clauses. This is typically formulated as a decision problem or an optimization problem, where the objective is to maximize the number of satisfied clauses subject to some constraints.
Articles by others on the same topic
There are currently no matching articles.