A problem Q is a binary relation on a set I of instances and a set S of solutions.

Example: Shortest-Path Problem