Problem 3: For the graph above, use gringo/clasp to find all independent sets containing four nodes (a set of nodes in a graph is independent if no two of its elements are connected with an edge).

Repeat the exercise to find all independent sets with five nodes.

As before, solve the problem by constructing propositional theories describing the two problems (one where we seek four-node independent sets and the second one when we seek a five-node independent set), rewrite them into the gringo format, and run them through gringo/clasp.

6 4 6 4