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

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

problems, which are NP-complete, 2-satisfiability can be solved in polynomial time. Instances of the 2-satisfiability problem are typically expressed as...

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

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

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...

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...

to be NP-complete by reducing Exact cover to Knapsack. Satisfiability: the boolean satisfiability problem for formulas in conjunctive normal form (often...

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 get the MAX-3SAT...

CircuitSAT can be reduced to the other satisfiability problems to prove their NP-completeness. The satisfiability of a circuit containing m {\displaystyle...

is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for...

same as the satisfiability of ∀ x ∃ y R ( x , y ) {\displaystyle \forall x\exists yR(x,y)} . At the meta-level, first-order satisfiability of a formula...

that was formulated by Impagliazzo & Paturi (1999). It states that satisfiability of 3-CNF Boolean formulas cannot be solved in subexponential time, 2...

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...

Planning as Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance of the Boolean satisfiability problem...

Domination analysis of an approximation algorithm is a way to estimate its performance, introduced by Glover and Punnen in 1997. Unlike the classical approximation...

NP-complete problem. For example, the 3-satisfiability problem, a restriction of the Boolean satisfiability problem, remains NP-complete, whereas the...

transformed mechanically into a Boolean satisfiability problem in polynomial time. The Boolean satisfiability problem is one of many NP-complete problems...

whether there is any valuation that makes a formula true is the Boolean satisfiability problem; the problem of checking tautologies is equivalent to this problem...

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

variable twice in a clause. Boolean satisfiability problem Schaefer, Thomas J. (1978). "The complexity of satisfiability problems" (PDF). Proceedings of the...

of the Boolean satisfiability problem despite there being no known efficient algorithm in the general case. The Boolean satisfiability (or SAT) problem...

range is invalid, the server responds with a 416 Requested Range Not Satisfiable status code. Clients which request byte-serving might do so in cases...

a non-empty set of equations are known as equational theories. The satisfiability problem for free theories is solved by syntactic unification; algorithms...

the server requires that images use a different format. 416 Range Not Satisfiable The client has asked for a portion of the file (byte serving), but the...

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...

In digital logic, a don't-care term (abbreviated DC, historically also known as redundancies, irrelevancies, optional entries, invalid combinations, vacuous...

not occur. since one way to check a CNF for satisfiability is to convert it into a DNF, the satisfiability of which can be checked in linear time 1 ≤ m...

whether the problem is satisfiable. Enforcing strong directional i {\displaystyle i} -consistency allows telling the satisfiability of problems that have...

into Boolean satisfiability problems is called satplan. MaxWalkSAT is a variant of WalkSAT designed to solve the weighted satisfiability problem, in which...