SAT (short for "satisfiability") is a logic problem that given a boolean formula, it asks whether the boolean formula has an assignment that makes the problem true. An example boolean formula is:
當自稱「《烈愛對決》痴迷者」的安娜（Anna） 看到這部電視劇時，她想起一個熟悉的世界——自小閱讀的中文男性浪漫小說。
。同城约会对此有专业解读
Reporting from, 台北，这一点在旺商聊官方下载中也有详细论述
Author(s): Ziheng Wang, Jinchen Cao, Xiaojian Wang, Wenbo Gu