Tag
satisfiability
- Oct 12, 2026 The Cook–Levin Tableau: Encoding a Computation as a Formula How a nondeterministic polynomial-time computation becomes a boolean formula whose satisfying assignments correspond exactly to accepting runs, and what the encoding costs in variables and clauses. computation theory
- Aug 29, 2026 Trakhtenbrot’s Theorem and the Finite Model Boundary Why first-order validity over all structures and over finite structures are both undecidable but for opposite reasons, and how a sentence can encode an entire halting computation in one finite domain. computation theory
- Jun 3, 2026 Equivalence Checking: Proving a Netlist Matches Its RTL How combinational equivalence is reduced to a miter of two circuits and a satisfiability question, why sequential transformations break that reduction, and where the proof stops being cheap. hardware engineering
- Aug 4, 2023 Dependency Resolution as a Satisfiability Problem How version selection encodes into boolean clauses, why the decision problem is NP-complete, and what that bound predicts about real installs and about optimisation criteria. developer tools
- Jun 10, 2022 Why Three Literals Is the Pivot for Satisfiability The reduction from general CNF to 3-SAT, why 2-SAT is solvable in linear time while 3-SAT is complete, and how clause length controls the shape of the search space. computation theory