relationalai 0.12.8__py3-none-any.whl → 0.12.10__py3-none-any.whl

relationalai/semantics/reasoners/graph/core.py

@@ -20,7 +20,7 @@ from relationalai.semantics import (
     count, sum, avg,
 )
 from relationalai.docutils import include_in_docs
-from relationalai.semantics.internal import annotations
+from relationalai.semantics.internal import annotations, AnyEntity
 from relationalai.semantics.internal import internal as builder_internal # For primitive graph algorithms.
 from relationalai.semantics.std.math import abs, isnan, isinf, maximum, natural_log, sqrt
 from relationalai.semantics.std.integers import int64
@@ -158,7 +158,7 @@ class Graph():
             f"but is a `{type(weighted).__name__}`."
         )
         assert isinstance(model, Model), (
-            "The `model` argument must be a `builder.Model`, "
+            "The `model` argument must be a `relationalai.semantics.Model`, "
             f"but is a `{type(model).__name__}`."
         )
         self.directed = directed
@@ -355,7 +355,7 @@ class Graph():
     @cached_property
     def Node(self) -> Concept:
         """Lazily define and cache the self.Node concept."""
-        _Node = self._user_node_concept or self._model.Concept(self._NodeConceptStr)
+        _Node = self._user_node_concept or self._model.Concept(self._NodeConceptStr, extends=[AnyEntity])
         _Node.annotate(annotations.track("graphs", "Node"))
         return _Node
 
@@ -2304,14 +2304,14 @@ class Graph():
                 # neighbor_a_rel = self._neighbor_of(node_subset_from)
                 #
                 # domain_w = Relationship(f"{{node:{self._NodeConceptStr}}} is the domain of `w` in `common_neighbor(u, v, w)`")
-                # node_x, node_y = graph.Node.ref(), graph.Node.ref()
-                # where(neighbor_a_rel(node_x, node_y)).define(domain_w(node_y))
+                # where(neighbor_a_rel(node_a, node_b)).define(domain_w(node_b))
                 # neighbor_b_rel = self._neighbor_of(domain_w)
                 #
                 # node_constraint = []
                 #
-                # # need to reverse the args of `neighbor_b_rel()`, due to its domain constraint
-                # # relies on the symmetry of `neighbor`
+                # # For this case only, we reverse the args of `neighbor_b_rel()`, which
+                # # is allowed by the symmetry of `neighbor`, in order to take advantage
+                # # of domain constraint on `neighbor_b_rel()`.
                 # where(
                 #     *node_constraint,
                 #     neighbor_a_rel(node_a, neighbor_node),
@@ -2748,15 +2748,15 @@ class Graph():
         if node_subset is None:
             # No constraint - use cached count_inneighbor relationship and all nodes
             count_inneighbor_rel = self._count_inneighbor
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset - use constrained count_inneighbor relationship
             count_inneighbor_rel = self._count_inneighbor_of(node_subset)
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the same indegree logic for both cases
         where(
-            node_set(self.Node),
+            *node_constraint,
             _indegree := where(count_inneighbor_rel(self.Node, Integer)).select(Integer) | 0,
         ).define(_indegree_rel(self.Node, _indegree))
 
@@ -2933,15 +2933,15 @@ class Graph():
         if node_subset is None:
             # No constraint - use cached count_outneighbor relationship and all nodes
             count_outneighbor_rel = self._count_outneighbor
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset - use constrained count_outneighbor relationship
             count_outneighbor_rel = self._count_outneighbor_of(node_subset)
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the same outdegree logic for both cases
         where(
-            node_set(self.Node),
+            *node_constraint,
             _outdegree := where(count_outneighbor_rel(self.Node, Integer)).select(Integer) | 0,
         ).define(_outdegree_rel(self.Node, _outdegree))
 
@@ -3099,12 +3099,12 @@ class Graph():
             node, neighbor, weight = self.Node.ref(), self.Node.ref(), Float.ref()
 
             if node_subset is None:
-                node_constraint = node  # No constraint on nodes.
+                node_constraint = []  # No constraint on nodes.
             else:
-                node_constraint = node_subset(node)  # Nodes constrained to given subset.
+                node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
             where(
-                node_constraint,
+                *node_constraint,
                 weighted_degree_no_loops := sum(neighbor, weight).per(node).where(
                     self._weight(node, neighbor, weight),
                     node != neighbor,
@@ -3172,7 +3172,7 @@ class Graph():
         >>> define(n1, n2, n3)
         >>> define(
         ...     Edge.new(src=n1, dst=n2, weight=1.0),
-        ...     Edge.new(src=n2, dst=n1, weight=-1.0),
+        ...     Edge.new(src=n2, dst=n1, weight=0.0),
         ...     Edge.new(src=n2, dst=n3, weight=1.0),
         ... )
         >>>
@@ -3186,7 +3186,7 @@ class Graph():
         ... ).inspect()
         ▰▰▰▰ Setup complete
             id  node_weighted_indegree
-        0   1                    -1.0
+        0   1                     0.0
         1   2                     1.0
         2   3                     1.0
         >>>
@@ -3218,9 +3218,6 @@ class Graph():
         weighted_outdegree
 
         """
-        # TODO: It looks like the weights in the example in the docstring above
-        #   are holdovers from a version of the library that did not disallow
-        #   negative weights. Need to update the example to use only non-negative weights.
         if of is None:
             return self._weighted_indegree
         else:
@@ -3251,20 +3248,15 @@ class Graph():
         # Choose the appropriate node set
         if node_subset is None:
             # No constraint - use all nodes
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset
-            node_set = node_subset
-        # TODO: In a future cleanup pass, replace `node_set` with a `node_constraint`
-        #   that replaces the `node_set(self.Node)` in the where clause below,
-        #   and generates only `self.Node` (rather than `self.Node(self.Node)`)
-        #   in the `subset is None` case. This applies to a couple other
-        #   degree-of type relations as well.
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the weighted indegree logic for both cases
         src, inweight = self.Node.ref(), Float.ref()
         where(
-            node_set(self.Node),
+            *node_constraint,
             _weighted_indegree := sum(src, inweight).per(self.Node).where(self._weight(src, self.Node, inweight)) | 0.0,
         ).define(_weighted_indegree_rel(self.Node, _weighted_indegree))
 
@@ -3324,7 +3316,7 @@ class Graph():
         >>> define(n1, n2, n3)
         >>> define(
         ...     Edge.new(src=n1, dst=n2, weight=1.0),
-        ...     Edge.new(src=n2, dst=n1, weight=-1.0),
+        ...     Edge.new(src=n2, dst=n1, weight=0.0),
         ...     Edge.new(src=n2, dst=n3, weight=1.0),
         ... )
         >>>
@@ -3339,7 +3331,7 @@ class Graph():
         ▰▰▰▰ Setup complete
             id  node_weighted_outdegree
         0   1                      1.0
-        1   2                      0.0
+        1   2                      1.0
         2   3                      0.0
         >>>
         >>> # 4. Use 'of' parameter to constrain the set of nodes to compute weighted outdegree of
@@ -3355,7 +3347,7 @@ class Graph():
         ▰▰▰▰ Setup complete
             id  node_weighted_outdegree
         0   1                      1.0
-        1   2                      0.0
+        1   2                      1.0
 
         Notes
         -----
@@ -3404,15 +3396,15 @@ class Graph():
         # Choose the appropriate node set
         if node_subset is None:
             # No constraint - use all nodes
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the weighted outdegree logic for both cases
         dst, outweight = self.Node.ref(), Float.ref()
         where(
-            node_set(self.Node),
+            *node_constraint,
             _weighted_outdegree := sum(dst, outweight).per(self.Node).where(self._weight(self.Node, dst, outweight)) | 0.0,
         ).define(_weighted_outdegree_rel(self.Node, _weighted_outdegree))
 
@@ -4537,12 +4529,12 @@ class Graph():
         _triangle_count_rel = self._model.Relationship(f"{{node:{self._NodeConceptStr}}} belongs to {{count:Integer}} triangles")
 
         if node_subset is None:
-            node_constraint = self.Node # No constraint on nodes.
+            node_constraint = [] # No constraint on nodes.
         else:
-            node_constraint = node_subset(self.Node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(self.Node)]  # Nodes constrained to given subset.
 
         where(
-            node_constraint,
+            *node_constraint,
             _count := self._nonzero_triangle_count_fragment(self.Node) | 0
         ).define(_triangle_count_rel(self.Node, _count))
 
@@ -4819,16 +4811,16 @@ class Graph():
         if node_subset is None:
             degree_no_self_rel = self._degree_no_self
             triangle_count_rel = self._triangle_count
-            node_constraint = node  # No constraint on nodes.
+            node_constraint = []  # No constraint on nodes.
         else:
             degree_no_self_rel = self._degree_no_self_of(node_subset)
             triangle_count_rel = self._triangle_count_of(node_subset)
-            node_constraint = node_subset(node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
         degree_no_self = Integer.ref()
         triangle_count = Integer.ref()
         where(
-            node_constraint,
+            *node_constraint,
             _lcc := where(
                 degree_no_self_rel(node, degree_no_self),
                 triangle_count_rel(node, triangle_count),
@@ -4866,12 +4858,12 @@ class Graph():
         node, neighbor = self.Node.ref(), self.Node.ref()
 
         if node_subset is None:
-            node_constraint = node  # No constraint on nodes.
+            node_constraint = []  # No constraint on nodes.
         else:
-            node_constraint = node_subset(node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
         where(
-            node_constraint,
+            *node_constraint,
             _dns := count(neighbor).per(node).where(self._no_loop_edge(node, neighbor)) | 0,
         ).define(_degree_no_self_rel(node, _dns))
 
@@ -7296,7 +7288,7 @@ class Graph():
 
         # TODO: Optimization opportunity. In some of the cases below
         #   (unweighted in particular), the node_constraint is redundant with
-        #   the constraints baked into the _count_outneigherbor_of and
+        #   the constraints baked into the _count_outneighbor_of and
         #   _outneighbor_of relationships. The join with node_constraint
         #   could be eliminated in those cases. Possibly also relevant to
         #   other domain-constrained relations.
@@ -7366,19 +7358,18 @@ class Graph():
         # Define cosine similarity logic for both weighted and unweighted cases.
         if not self.weighted:
             # Unweighted case: use count of common outneighbors.
-            count_outneighor_u, count_outneighor_v = Integer.ref(), Integer.ref()
+            count_outneighbor_u, count_outneighbor_v = Integer.ref(), Integer.ref()
             common_outneighbor_node = self.Node.ref()
-            score = Float.ref()
 
             where(
                 *node_constraints,
-                count_outneighbor_u_rel(node_u, count_outneighor_u),
-                count_outneighbor_v_rel(node_v, count_outneighor_v),
+                count_outneighbor_u_rel(node_u, count_outneighbor_u),
+                count_outneighbor_v_rel(node_v, count_outneighbor_v),
                 c_common := count(common_outneighbor_node).per(node_u, node_v).where(
                     outneighbor_u_rel(node_u, common_outneighbor_node),
                     outneighbor_v_rel(node_v, common_outneighbor_node),
                 ),
-                score := c_common / sqrt(count_outneighor_u * count_outneighor_v),
+                score := c_common / sqrt(count_outneighbor_u * count_outneighbor_v),
             ).define(
                 _cosine_similarity_rel(node_u, node_v, score)
             )
@@ -8186,13 +8177,13 @@ class Graph():
         neighbor_node = self.Node.ref()
         if node_subset is not None:
             neighbor_rel = self._neighbor_of(node_subset)
-            node_constraint = node_subset(self.Node)
+            node_constraint = [node_subset(self.Node)]
         else:
             neighbor_rel = self._neighbor
-            node_constraint = self.Node
+            node_constraint = []
 
         where(
-            node_constraint,
+            *node_constraint,
             not_(neighbor_rel(self.Node, neighbor_node))
         ).define(_isolated_node_rel(self.Node))
 

relationalai/semantics/rel/compiler.py

@@ -12,7 +12,7 @@ from relationalai.semantics.metamodel.util import OrderedSet, group_by, NameCach
 from relationalai.semantics.rel import rel, rel_utils as u, builtins as rel_bt
 
 from ..metamodel.rewrite import (Flatten, ExtractNestedLogicals, DNFUnionSplitter, DischargeConstraints, FormatOutputs)
-from ..lqp.rewrite import CDC, ExtractCommon, ExtractKeys, FunctionAnnotations, QuantifyVars, Splinter
+from ..lqp.rewrite import CDC, ExtractCommon, ExtractKeys, FunctionAnnotations, QuantifyVars, Splinter, SplitMultiCheckRequires
 
 import math
 
@@ -24,6 +24,7 @@ import math
 class Compiler(c.Compiler):
     def __init__(self):
         super().__init__([
+            SplitMultiCheckRequires(),
             FunctionAnnotations(),
             DischargeConstraints(),
             Checker(),
@@ -696,7 +697,24 @@ class ModelToRel:
         rel_annos = cast(Tuple[rel.Annotation, ...], self.handle_list(filtered_annos))
         return rel_annos
 
+    # standard handling mistreats the integer arg of ranked `@function(:checked, k)`
+    def handle_ranked_function_annotation(self, n: ir.Annotation):
+        assert n.relation == bt.function_ranked and len(n.args) == 2
+        checked_lit = n.args[0]
+        rank_lit = n.args[1]
+        assert isinstance(checked_lit, ir.Literal) and isinstance(rank_lit, ir.Literal)
+        checked = rel.MetaValue(checked_lit.value)
+        rank = rank_lit.value
+        return rel.Annotation(
+            n.relation.name,
+            (checked, rank)
+        )
+
     def handle_annotation(self, n: ir.Annotation):
+        # special treatment for (ranked) @function(:checked, k)
+        if n.relation == bt.function_ranked:
+            return self.handle_ranked_function_annotation(n)
+
         # we know that annotations won't have vars, so we can ignore that type warning
         return rel.Annotation(
             n.relation.name,

relationalai/semantics/tests/test_snapshot_abstract.py

@@ -2,6 +2,7 @@ import logging
 import os
 import uuid
 import sys
+import datetime
 from abc import abstractmethod, ABC
 
 from relationalai.semantics.tests.logging import Capturer
@@ -47,6 +48,8 @@ class AbstractSnapshotTest(ABC):
                 'use_sql': use_sql,
                 'reasoner.rule.use_lqp': use_lqp,
                 'keep_model': False,
+                # fix the current time to keep snapshots stable
+                'datetime_now': datetime.datetime.fromisoformat("2025-12-01T12:00:00+00:00"),
             }
             if use_direct_access:
                 # for direct access we can not use user/password authentication

relationalai/tools/debugger.py

@@ -3,6 +3,8 @@ import re
 from nicegui import ui
 import json
 
+from relationalai.debugging import DEBUG_LOG_FILE
+
 
 last_mod_time = None
 current_json_objects = []
@@ -141,12 +143,12 @@ def poll():
     global current_json_objects
     # Check the last modification time of the file
     try:
-        mod_time = os.path.getmtime('debug.jsonl')
+        mod_time = os.path.getmtime(DEBUG_LOG_FILE)
         if last_mod_time is None or mod_time > last_mod_time:
             last_mod_time = mod_time
             # File has changed, read and parse the new content
             new_objects = []
-            with open('debug.jsonl', 'r') as file:
+            with open(DEBUG_LOG_FILE, 'r') as file:
                 for line in file:
                     try:
                         # Parse each JSON object and add it to the list

relationalai/tools/qb_debugger.py

@@ -3,6 +3,8 @@ import re
 from nicegui import ui
 import json
 
+from relationalai.debugging import DEBUG_LOG_FILE
+
 #--------------------------------------------------
 # Terminal nodes
 #--------------------------------------------------
@@ -12,7 +14,7 @@ TERMINAL_NODES = [
 ]
 
 #--------------------------------------------------
-# debug.jsonl helpers
+# Debug log helpers
 #--------------------------------------------------
 
 class SpanNode:
@@ -344,11 +346,11 @@ def poll():
     global current_json_objects
     # Check the last modification time of the file
     try:
-        mod_time = os.path.getmtime('debug.jsonl')
+        mod_time = os.path.getmtime(DEBUG_LOG_FILE)
         if last_mod_time is None or mod_time > last_mod_time:
             last_mod_time = mod_time
             # File has changed, read and parse the new content
-            with open('debug.jsonl', 'r') as file:
+            with open(DEBUG_LOG_FILE, 'r') as file:
                 content = file.read()
                 if content:
                     new_tree = parse_jsonl_to_tree(content)

relationalai/util/otel_handler.py

@@ -20,6 +20,7 @@ from relationalai.debugging import logger, Span, filter_span_attrs, otel_traceid
 from relationalai.clients.snowflake import Resources
 
 MAX_PAYLOAD_SIZE = 25*1024 # 25KB
+MAX_ATTRIBUTE_LENGTH = 1000
 _otel_initialized = False
 
 
@@ -44,8 +45,6 @@ class CachedSpanExporter(SpanExporter):
 
     def get_spans(self):
         return self.spans
-
-
 class NativeAppSpanExporter(SpanExporter):
     def __init__(self, resource:Resources, app_name:str):
         self.resource = resource
@@ -252,6 +251,12 @@ def encode_otlp_attribute(k, v):
     try:
         valueObj = {}
         if isinstance(v, str):
+            # Truncate metamodel attribute value if it's too large
+            if k == "metamodel" and len(v) > MAX_ATTRIBUTE_LENGTH:
+                original_length = len(v)
+                v = v[:MAX_ATTRIBUTE_LENGTH] + f"... (truncated from {original_length} chars)"
+                logging.warning(f"{k} attribute truncated from {original_length} to {MAX_ATTRIBUTE_LENGTH} characters")
+
             valueObj = {
                 "stringValue": html.escape(v).replace("\n", "; ")
             }
@@ -369,7 +374,7 @@ def encode_spans_to_otlp_json(spans: Sequence[ReadableSpan], max_bytes: int) ->
     except Exception as e:
         logging.warning(f"Error encoding resource to OTLP JSON: {e}")
         return "", spans  # Return the unencoded spans if resource encoding fails
-    
+
     # TODO encode pyrel version for real
     header_str = f'{{"resourceSpans": [{{"resource":{resource_str}, "scopeSpans": [{{"scope":{{"name":"pyrel", "version":"v0.4.0"}},"spans":['
     footer_str = ']}]}]}'
@@ -378,7 +383,7 @@ def encode_spans_to_otlp_json(spans: Sequence[ReadableSpan], max_bytes: int) ->
     encoded_spans = []
     for span in spans:
         try:
-            span_str = encode_span_to_otlp_json(span)
+            span_str = encode_span_to_otlp_json(span)          
         except Exception as e:
             logging.warning(f"Error encoding span {span}: {e}")
             continue  # Skip this span if encoding fails
@@ -460,6 +465,7 @@ def enable_otel_export(client_resources: Resources, app_name):
     if _otel_initialized:
         logging.warning("OTel already initialized, skipping.")
         return
+    
     _otel_initialized = True
 
     if TRACE_PROVIDER is None:

{relationalai-0.12.8.dist-info → relationalai-0.12.10.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: relationalai
-Version: 0.12.8
+Version: 0.12.10
 Summary: RelationalAI Library and CLI
 Author-email: RelationalAI <support@relational.ai>
 License-File: LICENSE
@@ -11,7 +11,7 @@ Requires-Dist: colorama
 Requires-Dist: cryptography
 Requires-Dist: gravis
 Requires-Dist: inquirerpy
-Requires-Dist: lqp==0.1.18
+Requires-Dist: lqp==0.1.19
 Requires-Dist: nicegui==2.16.1
 Requires-Dist: numpy<2
 Requires-Dist: opentelemetry-api