2. Explore the examples available at http://potassco.org/clingo/   

3. Consider the mythological puzzle (lecture 02).
a) Encode the problem into ASP.
b) Get the answer sets from clingo.

4. Consider an undirected graph
a) Encode into ASP the problem of checking if two particular vertexes are connected.
b) Get the answer sets from clingo
c) Encode the problem of finding the shortest path between two particular vertexes.
d) Get the answer sets from clingo

5. Consider the vertex covering problem of an undirected graph.
a) Encode the problem of finding the minimum-size vertex cover into ASP.
b) Get the answer sets from clingo.

6. (Optional) Consider the houses puzzle (lecture 02).
a) Encode the problem into ASP.
b) Get the answer sets from clingo.