Advanced · Research

Satisfiability

Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.

TL;DR. A concept in logic determining if a formula can be made true by assigning values to its variables.

Technical Definition

A concept in logic determining if a formula can be made true by assigning values to its variables.

How it works

Satisfiability (SAT) is a fundamental problem in mathematical logic and computer science. A formula is satisfiable if there exists at least one assignment of truth values to its variables that makes the entire formula true. Finding such an assignment is the goal of SAT solvers, which are crucial for many AI and verification tasks.