callGraph

The predicate call graph of this Theory: one node per Indicator (functor/arity) that occurs as a rule head or as a body literal, and one edge per rule from its head's Indicator to each body literal's Indicator it calls — the edge weight is true for a positive call and false for a call through negation (isNegated). Facts contribute a node but no outgoing edge. Used by isNonRecursive to detect (possibly indirect, possibly negated) recursion.