Update minimized predicate example

Author: ColtonPayne

examples/circumscription_ex.py examples/closed_world_pred_ex.pyexamples/circumscription_ex.py renamed to examples/closed_world_pred_ex.py

@@ -11,20 +11,29 @@
 g.add_edge('cb_1', 'cb_2', stepFrom =1)
 g.add_edge('cb_1',  'l1', hasLabel = 1)
 g.add_edge('cb_2',  'l2', hasLabel = 1)
-#g.add_edge('l1','l2', cond=1) # Adding this edge will 
+#g.add_edge('l1','l2', cond=1) # Adding this edge will satisfy hackerControl(cb)
 
 pr.settings.verbose = True
 pr.settings.atom_trace = True
 pr.settings.inconsistency_check = True
 
 pr.load_graph(g)
 
+# hackerControl is a closed-world pred, meaning that it will be grounded as [0,0] if its bounds are [0,1] (or if it is not in the interpretation dict)
 pr.add_closed_world_predicate('hackerControl')
+
+# Initial fact instantiation
 pr.add_fact(pr.Fact('stepFrom(cb_1, cb_2)', 'step_from_fact', 0, 1))
-pr.add_fact(pr.Fact('hackerControl(cb_1)', 'hacker_control_initial_fact'))
+pr.add_fact(pr.Fact('hackerControl(cb_1)', 'hacker_control_initial_fact', 0, 0))
+
+# Future(Y) will fire for cb_2
 pr.add_rule(pr.Rule('future(Y) <-1 stepFrom(X,Y), hackerControl(X)'))
+
+#This rule will not fire for cb_2, as cond(cb_1, cb_2) is not grounded
 pr.add_rule(pr.Rule('hackerControl(Y) <-1 hackerControl(X), hasLabel(X,L1), hasLabel(Y,L2), cond(L1, L2), stepFrom(X,Y)', 'hacker-control-rule'))
-pr.add_rule(pr.Rule('hackerControl(Y) <-1 hackerControl(X), hasLabel(X,L1), hasLabel(Y,L2), cond_1(L1, L2), stepFrom(X,Y)', 'hacker-control-rule-1'))
+
+# At timestep 1, hackerControl(cb_1) and hackerControl(cb_2) have no associated bounds, so they are treated as [0,1].
+# Because hackerControl is minimized, its bounds are gounded as [0,0].  Future(cb_2) has bounds [1,1], so inconsistent(cb_2) fires.
 pr.add_rule(pr.Rule('inconsistent(Y) <- future(Y), ~hackerControl(Y), ~hackerControl(X)', 'inconsistent_rule'))