"There is a pleasantly discursive treatment of
 Pontius Pilate's unanswered question 'What is truth?'"
— H. S. M. Coxeter, 1987

Returning to the Walpurgisnacht posts
Decomposition (continued) and
Decomposition– Part III —

Some further background…

SAT

(Not  a Scholastic Aptitude Test)

"In computer science, satisfiability (often written
in all capitals or abbreviated SAT) is the problem
of determining if the variables of a given Boolean
 formula can be assigned in such a way as to
make the formula evaluate to TRUE."

— Wikipedia article Boolean satisfiability problem

For the relationship of logic decomposition to SAT,
see (for instance) these topics in the introduction to—

Advanced Techniques in Logic Synthesis,
Optimizations and Applications* —

Click image for a synopsis.

* Edited by Sunil P. Khatri and Kanupriya Gulati