Example: air traffic controller
Search results with tag "Satisfiability problem"
The Satisfiability Problem - Stanford University
infolab.stanford.eduBoolean Expressions Boolean, or propositional-logic expressions are built from variables and constants using the operators AND, OR, and NOT. Constants are true and false, represented by 1 and 0, respectively. We’ll use concatenation (juxtaposition) for AND, + for OR, - …