Skip to main content
satisfiability

satisfiability

1 9.9
The chance that a logical statement can be true when you give values to its variables
  • noun
  • /ˌsætɪsfaɪəˈbɪlɪti/
  • Specialized
: satisfacibilidad
  • The satisfiability of a formula depends on whether an appropriate assignment can make it true.
  • satisfiability problem
  • satisfiability solvers

And so I began looking for reductions from the satisfiability to other problems.

Examples

  • OK, now suppose that I have a way to test satisfiability of circuits.

  • A decision procedure for satisfiability of a class of formulas accepts a formula (constraint) in its class and checks if, for some values of its variables, the formula evaluates to true.

    Academic text (2012)
  • And so I began looking for reductions from the satisfiability to other problems.

  • Figure 5 shows how the size of satisfiability problems that can be solved in a fixed amount of time improved 1000-fold from 1998 to 2010.

    Academic text (2017)
  • The three SAT problem is the satisfiability problem restricted to these three CNF formulas.

  • Note that the satisfiability of constraints that contain multiplications of variables is, in general, undecidable.

    Academic text (2012)
  • Other successful ASP solver algorithms are based on reductions of answer set solving to satisfiability testing.

    Academic text (2011)
  • In computer science, researchers often investigate the satisfiability of complex logical formulas to determine their truth value.

  • Understanding satisfiability is crucial for solving various logical problems and optimizing algorithms.

Antonyms

Not possible to meet a demand or to solve a problem

Surface Forms

Morphology

satisfiability = satisfiable (transparent) = satisfy + able + ity

Formed by adding the noun-forming suffix '-ity' to the clear adjective 'satisfiable' (satisfy + -able).

Etymology

Satisfiability comes from satisfy, which itself comes from the old parts satis 'enough' and facere 'to make', plus the endings -able 'can be' and -ity 'the state of'. So in logic, satisfiability means a formula 'can be made true' by giving the right values.