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

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

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: dialectical-framework
-Version: 1.1.0
+Version: 1.1.2
 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.2}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "dialectical-framework"
-version = "1.1.0"
+version = "1.1.2"
 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.2}/src/dialectical_framework/agents/analyst/skills/expand_polarities.py

@@ -91,20 +91,9 @@ class ExpandPolarity(ReasonableConcern[list[Perspective]]):
         partial_pps = [pp for pp in existing_pps if not pp.is_complete()]
 
         if not partial_pps:
-            self._report.ok = True
-            self._report.summary = (
-                f"{len(complete_pps)} complete Perspective(s), no partial Perspectives to expand"
-            )
-            self._report.artifacts["perspective_hashes"] = [
-                pp.hash for pp in complete_pps if pp.hash
-            ]
-            self._report.artifacts["total_count"] = len(complete_pps)
-            self._report.artifacts["existing_count"] = len(complete_pps)
-            self._report.artifacts["new_count"] = 0
-            self._report.artifacts["perspectives"] = [
-                self._perspective_final_state(pp) for pp in complete_pps
-            ]
-            return complete_pps
+            # All existing perspectives are complete — create a new one
+            pp = self._create_perspective_for_polarity(polarity)
+            partial_pps = [pp]
 
         # Complete all partial PPs
         completed_pps: list[Perspective] = []
@@ -314,7 +303,7 @@ class ExpandPolarity(ReasonableConcern[list[Perspective]]):
 async def expand_polarities(
     polarity_hashes: Annotated[list[str], Field(description="Hashes of Polarities to expand into full Perspectives")],
 ) -> str:
-    """Build complete Perspectives from Polarities by generating evaluative aspects (T+, T-, A+, A-) for each. Runs in parallel. The Polarities must already exist in the graph."""
+    """Build complete Perspectives from Polarities by generating evaluative aspects (T+, T-, A+, A-) for each. Each call generates one new Perspective per Polarity — call multiple times for alternative perspectives on the same Polarity (duplicates in a single call are ignored). The Polarities must already exist in the graph."""
     import asyncio
 
     async def _expand_one(h: str) -> str:
@@ -322,5 +311,6 @@ async def expand_polarities(
         await concern.resolve()
         return str(concern.report)
 
-    results = await asyncio.gather(*[_expand_one(h) for h in polarity_hashes])
+    unique_hashes = list(dict.fromkeys(polarity_hashes))
+    results = await asyncio.gather(*[_expand_one(h) for h in unique_hashes])
     return "\n---\n".join(results)

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/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)
@@ -156,13 +155,13 @@ class FindPolarities(ReasonableConcern[Optional[Ideas]]):
             result.existing = existing_antitheses
             return result
 
+        unique_hashes = list(dict.fromkeys(self.thesis_hashes))
         thesis_results = await asyncio.gather(
-            *[_process_thesis(h) for h in self.thesis_hashes]
+            *[_process_thesis(h) for h in unique_hashes]
         )
 
         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 +191,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 +239,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 +448,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 +510,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

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/src/dialectical_framework/agents/analyst/system_prompts.py

@@ -94,6 +94,8 @@ Adapt depth and presentation to the persona defined in the app preamble.
 ## Rules
 
 - Never dump raw tool output. Synthesize into appropriate presentation.
+- Never rephrase Statement text. Use exact text (or display_text) from the graph — paraphrasing makes it ambiguous which node you're referring to.
+- When referencing structural nodes (Polarity, Perspective, Nexus, Cycle, Wheel, Transformation, Transition, Synthesis), always include the short hash for disambiguation.
 - User corrections take priority — act immediately, don't push back.
 - When resuming a session with existing data, use `present_analysis` to orient before acting.
 - Skill reports may contain truncated text previews. When you need to present exact node text to the user, use `inspect_node` or `present_analysis` by hash — never reconstruct or guess full text from truncated previews.

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/src/dialectical_framework/agents/apps.py

@@ -199,6 +199,13 @@ both sides contribute", "constructive co-existence", "where 1+1 > 2".
 - Frame pathways as options, not prescriptions. There are many valid recipes.
 - Present tensions as legitimate — both poles have constructive potential.
 
+## Viewport Scope
+
+Messages may include context about what the user is currently viewing. This tells you their active focus. Respect it:
+
+- Only operate on the node(s) in the user's viewport unless they explicitly reference something else or ask to switch.
+- Never silently pivot to other nodes outside the viewport. If you think working on a different node would help, ask first.
+
 ## Presentation Defaults
 
 Example of a correctly labeled position table:
@@ -213,7 +220,7 @@ Example of a correctly labeled position table:
 The "blindspot" label belongs ONLY to A+ and A- (the opposition's territory).
 T+ and T- are the holder's own visible territory — never label them as blindspots.
 
-- Never mention tool names, pipelines, graph operations, or node hashes.
+- Never mention tool names, pipelines, or graph operations.
 - User-facing structural terms (Wheel, Nexus, Cycle, Transformation, Position,
   Polarity) are fine to use — these are part of the UX vocabulary.
 - Position labels (T+, T-, A+, A-) can be introduced once the user understands

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/src/dialectical_framework/agents/conversation_facilitator.py

@@ -293,6 +293,12 @@ class ConversationFacilitator(SettingsAware):
         """Call LLM with format for structured output."""
         messages = self._messages
 
+        # Bedrock requires conversations to end with a user message.
+        # After the agentic tool loop, messages end with assistant — inject a
+        # user prompt so the extraction call is valid for all providers.
+        if messages and messages[-1].role == "assistant":
+            messages = [*messages, llm.messages.user("Provide your structured response.")]
+
         @use_brain(format=response_model)
         async def _llm_call():
             return messages

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/src/dialectical_framework/agents/explorer/explorer.py

@@ -119,8 +119,6 @@ def _build_tools() -> list:
         build_wheels
     from dialectical_framework.agents.explorer.skills.explore_transformations import \
         explore_transformations
-    from dialectical_framework.agents.explorer.tools.create_nexus import \
-        create_nexus
     from dialectical_framework.agents.explorer.tools.present_exploration import \
         present_exploration
     from dialectical_framework.agents.orchestrator.tools.get_schema import \
@@ -133,7 +131,6 @@ def _build_tools() -> list:
     return [
         build_wheels,
         explore_transformations,
-        create_nexus,
         present_exploration,
         inspect_node,
         query_graph,

{dialectical_framework-1.1.0 → dialectical_framework-1.1.2}/src/dialectical_framework/agents/explorer/system_prompts.py

@@ -44,14 +44,10 @@ When the user wants to go deeper on a specific transformation:
 - Use `inspect_node` to show full detail.
 - Explain the tetrad structure: Ac/Ac+/Ac- and Re/Re+/Re-.
 
-When the user wants to create a sub-exploration:
-- Use `create_nexus` to group a subset of perspectives for focused exploration.
-
 ## Tools
 
 - `build_wheels` -- Generate causal structures (Cycles + Wheels) from this Nexus. Use nexus_hash: "{nexus_hash}".
 - `explore_transformations` -- Generate Action-Reflection transformations for a Wheel.
-- `create_nexus` -- Create a sub-nexus for focused exploration of specific perspectives.
 - `present_exploration` -- Show current state of this Nexus: perspectives, wheels, transformations.
 - `inspect_node` -- Deep-dive any node by hash.
 - `query_graph` -- Raw Cypher for custom queries. Call `get_schema` first.
@@ -64,7 +60,8 @@ Adapt depth and presentation to the persona defined in the app preamble.
 ## Rules
 
 - Never dump raw tool output. Synthesize into appropriate presentation.
-- Always work within this Nexus ({nexus_hash}) unless creating a sub-nexus.
+- Never rephrase Statement text. Use exact text (or display_text) from the graph — paraphrasing makes it ambiguous which node you're referring to.
+- When referencing structural nodes (Polarity, Perspective, Nexus, Cycle, Wheel, Transformation, Transition, Synthesis), always include the short hash for disambiguation.
 - If the user wants to analyze new material, suggest they return to the analysis thread.
 - Skill reports may contain truncated text previews. When you need to present exact node text to the user, use `inspect_node` or `present_analysis` by hash — never reconstruct or guess full text from truncated previews.
 """