In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible...

science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) asks whether...

survey. The problem of Horn satisfiability is solvable in linear time. A polynomial-time algorithm for Horn satisfiability is recursive: A first termination...

meaning by providing additional axioms. The satisfiability modulo theories problem considers satisfiability of a formula with respect to a formal theory...

placed, then it may be solved efficiently by using an instance of 2-satisfiability to find a placement avoiding any conflicting pairs of placements; several...

It is also possible to define median graphs as the solution sets of 2-satisfiability problems, as the retracts of hypercubes, as the graphs of finite median...

most 2 literals, as in 2-satisfiability, we get the MAX-2SAT problem. If they are restricted to at most 3 literals per clause, as in 3-satisfiability, we...

ST-connectivity and 2-satisfiability. ST-connectivity asks, for nodes S and T in a directed graph, whether T is reachable from S. 2-satisfiability asks, given...

mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable. It generalizes the...

Algorithms for finding strongly connected components may be used to solve 2-satisfiability problems (systems of Boolean variables with constraints on the values...

is a given edge in the minimum weight spanning forest? Exclusive or 2-satisfiability: given a formula requiring that x i {\displaystyle x_{i}} or x j {\displaystyle...

the satisfiability of a Boolean formula in disjunctive normal form is easy: such a formula is satisfiable if and only if it contains a satisfiable conjunction...

cryptography, such as finding the first linear time algorithm for 2-satisfiability and showing the equivalence of the complexity classes PSPACE and IP...

in polynomial time by transforming the problem into an instance of 2-satisfiability. An extensive comparison and discussion of nonogram solving algorithms...

shown, for example, by a reduction from maximum 2-satisfiability (a restriction of the maximum satisfiability problem). The weighted version of the decision...

the 3-satisfiability problem, a restriction of the Boolean satisfiability problem, remains NP-complete, whereas the slightly more restricted 2-satisfiability...

Each clause contains 2 literals. The satisfiability of such formulas can be decided in time linear in the number of clauses (see 2-SAT). Therefore, the...

were originally used for analyzing complex Boolean expressions. A 2-satisfiability instance in conjunctive normal form can be transformed into an implication...

determining if a partially filled square can be completed) Maximum 2-satisfiability: LO5  Maximum volume submatrix – Problem of selecting the best conditioned...

or the maximal matching problem or by an N C 2 {\displaystyle NC^{2}} reduction from the 2-satisfiability problem. Typically, the structure of the algorithm...

problem Integer factorization Knapsack problem Satisfiability problem 2-satisfiability Boolean satisfiability problem Subset sum problem 3SUM Traveling salesman...

computational complexity, not-all-equal 3-satisfiability (NAE3SAT) is an NP-complete variant of the Boolean satisfiability problem, often used in proofs of NP-completeness...

drawing, and in the implication graphs used to efficiently solve the 2-satisfiability problem. As defined, e.g., by Goldberg & Karzanov (1996), a skew-symmetric...

expressible as an instance of 2-satisfiability, the other solvable case of the satisfiability problem. By solving a 2-satisfiability instance to turn the given...

quantified Boolean formula problem (QBF) is a generalization of the Boolean satisfiability problem in which both existential quantifiers and universal quantifiers...

decision problems (even though, for example, finding the solution to a 2-satisfiability instance in polynomial time automatically gives a polynomial algorithm...

pages in a compatible way can be formulated as either an instance of 2-satisfiability, or as a problem of testing the bipartiteness of the circle graph whose...

Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP...

conflict-driven clause learning (CDCL) is an algorithm for solving the Boolean satisfiability problem (SAT). Given a Boolean formula, the SAT problem asks for an...

a SAT solver is a computer program which aims to solve the Boolean satisfiability problem (SAT). On input a formula over Boolean variables, such as "(x...