A literal is either a variable or its negation. If x is a variable, then x and NOT x are both literals. They represent opposite truth values. Clauses are built by ORing literals together. In -SAT, each clause has exactly two literals.
You need both positive and negative literals to express all constraints. This is standard terminology in boolean logic and SAT solving. Understanding literals helps you model problems correctly.