Jisho

×
充足可能性問題
Links
Wikipedia definition
1. Boolean satisfiability problem​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. Equally important is to determine whether no such assignments exist, which would imply that the function expressed by the formula is identically FALSE for all possible variable assignments.
Read “Boolean satisfiability problem” on English Wikipedia
Read “充足可能性問題” on Japanese Wikipedia
Read “Boolean satisfiability problem” on DBpedia

Discussions

to talk about this word.