dialectical-framework 1.1.0__tar.gz → 1.1.1__tar.gz

{dialectical_framework-1.1.0 → dialectical_framework-1.1.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: dialectical-framework
-Version: 1.1.0
+Version: 1.1.1
 Summary: A dialectical framework for augmented intelligence. AI reasoning powered with dialectics supports humans in: system optimization (psychology, engineering, business, politics, etc.); dispute resolution (mediation, conflicts, negotiations, etc.); decision-making (dilemmas, challenging situations, win-win, etc.).
 License: MIT
 Keywords: dialectics,dialectical-reasoning,synthesis,thesis-antithesis,ai,artificial-intelligence,llm,reasoning-framework,philosophy,logic,argumentation,conflict-resolution,decision-making,critical-thinking,semantic-graph,mirascope,pydantic,perspectives,polarity-reasoning

{dialectical_framework-1.1.0 → dialectical_framework-1.1.1}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "dialectical-framework"
-version = "1.1.0"
+version = "1.1.1"
 description = "A dialectical framework for augmented intelligence. AI reasoning powered with dialectics supports humans in: system optimization (psychology, engineering, business, politics, etc.); dispute resolution (mediation, conflicts, negotiations, etc.); decision-making (dilemmas, challenging situations, win-win, etc.)."
 authors = ["Evaldas Taroza <evaldas@dialexity.com>"]
 readme = "README.md"

{dialectical_framework-1.1.0 → dialectical_framework-1.1.1}/src/dialectical_framework/agents/analyst/skills/find_polarities.py

@@ -119,7 +119,6 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
         not_like_these = [c["statement"] for c in vocab]
 
         results: list[ThesisResult] = []
-        all_existing: list[Statement] = []
         newly_extracted: list[Statement] = []
 
         # Phase 1: For each thesis, collect existing oppositions + extract new ones (parallel)
@@ -162,7 +161,6 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
 
         for result in thesis_results:
             results.append(result)
-            all_existing.extend(result.existing)
             newly_extracted.extend(result.extracted)
 
         # Phase 2: Semantic deduplication (only newly extracted, not existing)
@@ -192,6 +190,20 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
                         data["hash"] = dedup_result.replacements[data["hash"]].hash
                         data["deduped"] = True
 
+        # Deduplicate antithesis_data entries per thesis — dedup can merge an
+        # extracted antithesis into one already present from existing oppositions,
+        # producing duplicate (thesis, antithesis) pairs in the same result.
+        for result in results:
+            if result.error:
+                continue
+            seen: set[str] = set()
+            unique_data: list[dict] = []
+            for data in result.antithesis_data:
+                if data["hash"] not in seen:
+                    seen.add(data["hash"])
+                    unique_data.append(data)
+            result.antithesis_data = unique_data
+
         # Phase 3: Create Polarity nodes for each T-A pair
         total_antitheses = sum(len(r.antithesis_data) for r in results if not r.error)
 
@@ -226,9 +238,15 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
                     }
                 )
 
-        # Build summary
-        existing_count = len(all_existing)
-        new_count = len(newly_extracted)
+        # Build summary — derive counts from deduplicated antithesis_data
+        existing_count = sum(
+            1 for r in results if not r.error
+            for d in r.antithesis_data if d.get("existing")
+        )
+        new_count = sum(
+            1 for r in results if not r.error
+            for d in r.antithesis_data if not d.get("existing")
+        )
 
         self._report.ok = True
         self._report.artifacts["thesis_count"] = len(self.thesis_hashes)
@@ -429,6 +447,11 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
                 if data["hash"] == result.thesis.hash:
                     continue
 
+                # Skip if this T-A pair was already processed (e.g. dedup merged
+                # an extracted antithesis into one already seen via existing oppositions)
+                if (result.thesis.hash, data["hash"]) in polarity_map:
+                    continue
+
                 antithesis = self._resolve_component(data["hash"])
                 if antithesis is None:
                     continue
@@ -486,15 +509,21 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
             ideas.inputs.connect(inp)
             self._report.relationship_created(ideas.inputs, ideas, inp)
 
-        # Connect all theses and antitheses
+        # Connect all theses and antitheses (deduplicated across theses)
+        connected_hashes: set[str] = set()
         for result in valid_results:
-            ideas.statements.connect(result.thesis)
-            self._report.relationship_created(
-                ideas.statements, ideas, result.thesis
-            )
+            if result.thesis.hash not in connected_hashes:
+                connected_hashes.add(result.thesis.hash)
+                ideas.statements.connect(result.thesis)
+                self._report.relationship_created(
+                    ideas.statements, ideas, result.thesis
+                )
             for data in result.antithesis_data:
+                if data["hash"] in connected_hashes:
+                    continue
                 comp = self._resolve_component(data["hash"])
                 if comp:
+                    connected_hashes.add(data["hash"])
                     ideas.statements.connect(comp)
                     self._report.relationship_created(
                         ideas.statements, ideas, comp