LTMS labels
The LTMS labels each proposition true, false, or unknown
- if p is labeled true (false), then ? logically entails p (¬p)
- labeling algorithm is sound, but not necessarily complete
- a positive (negative) literal is true if and only if the corresponding proposition is true (false)