Satisfiability

Layer 0 — Mathematicsin the logic subtree

A proposition is satisfiable iff there exists at least one assignment of truth values to its atomic propositions under which it is true — equivalently, iff it is not a contradiction. SAT (the decision problem 'is φ satisfiable?') is the…

Related concepts

Explore Satisfiability on the interactive knowledge graph →