Also known as propositional satisfiability problem, SATISFIABILITY, SAT
problem of determining if a Boolean formula could be made true
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).