compositional-explanations 0.0.4__tar.gz → 0.0.4.2__tar.gz

{compositional_explanations-0.0.4/src/compositional_explanations.egg-info → compositional_explanations-0.0.4.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: compositional_explanations
-Version: 0.0.4
+Version: 0.0.4.2
 Summary: Package to compute Compositional Explanations both in their optimal and beam format.
 Author-email: Biagio La Rosa <bilarosa@ucsc.edu>
 License: MIT

{compositional_explanations-0.0.4 → compositional_explanations-0.0.4.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "compositional_explanations"
-version = "0.0.4"
+version = "0.0.4.2"
 authors = [
   { name="Biagio La Rosa", email="bilarosa@ucsc.edu" },
 ]
@@ -26,4 +26,4 @@ dependencies = [
 
 [project.urls]
 Homepage = "https://github.com/aiea-lab/optimal-compositional-explanations"
-Issues = "https://github.com/aiea-lab/optimal-compositional-explanations/issues"
+Issues = "https://github.com/aiea-lab/optimal-compositional-explanations/issues"

{compositional_explanations-0.0.4 → compositional_explanations-0.0.4.2}/src/compositional_explanations/optimal.py

@@ -121,18 +121,18 @@ def apply_distributive_property(node):
         # considering the transformations since computing ((A AND NOT C) OR (B AND NOT C)) is more accurate than
         # computing ((A OR B) AND NOT C) since everythin is a pariwise estimation.
         return label
+    external_op = label.__class__
     if external_op == F.Or:
         # We do not rewrite (A AND B) OR C as (A OR C) AND (B OR C).
         # Otherwise, it would put C on both sides of an AND.
         # Our code assumes that AND removes always the unique elements,
-        # since it aassumes the concepts cannot be repeated.
-        # Therefore, it would underestimate the denominator of the IoU,
+        # since it assumes the concepts cannot be repeated.
+        # Therefore, it would underestimate the numerator of the IoU,
         # leading to a lower upper bound.
         return label
     label_left = label.left
     num_left_op = len(set(label_left.get_ops()))
     if num_left_op == 1:
-        external_op = label.__class__
         internal_op = label_left.__class__
         if external_op == internal_op:
             return label
@@ -142,8 +142,9 @@ def apply_distributive_property(node):
         for val in vals_left:
             inner_formula = external_op(F.Leaf(val), label.right)
             chain.append(inner_formula)
-        for i in range(len(chain) - 1):
-            final_formula = internal_op(chain[i], chain[i + 1])
+        final_formula = chain[0]
+        for term in chain[1:]:
+            final_formula = internal_op(final_formula, term)
         return final_formula
     else:
         return label

{compositional_explanations-0.0.4 → compositional_explanations-0.0.4.2/src/compositional_explanations.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: compositional_explanations
-Version: 0.0.4
+Version: 0.0.4.2
 Summary: Package to compute Compositional Explanations both in their optimal and beam format.
 Author-email: Biagio La Rosa <bilarosa@ucsc.edu>
 License: MIT