Struct MultiHopResolver 

pub struct MultiHopResolver { /* private fields */ }

Multi-hop backward-chaining resolver with loop detection.

Unlike crate::distributed_backward_chainer::DistributedBackwardChainer, which records a full crate::proof_tree::ProofTree, this resolver focuses on how many hops were taken and whether any hop triggered a loop.

Implementations

impl MultiHopResolver

pub fn new(config: MultiHopConfig) -> Self

Create a resolver with the given configuration.

pub async fn resolve<FP, FQ>( &self, goal: &Term, local_kb: &KnowledgeBase, find_providers: &FP, remote_query: &FQ, ) -> MultiHopResult

where FP: Fn(Cid) -> BoxFuture<'static, Vec<String>> + Send + Sync, FQ: Fn(String, Term) -> BoxFuture<'static, Option<Vec<HashMap<String, Term>>>> + Send + Sync,

Attempt to resolve goal using multi-hop backward chaining.

The two callbacks follow the same conventions as DistributedBackwardChainer::prove_with_tree:

• find_providers(cid) → list of peer IDs that might hold rules for cid.
• remote_query(peer_id, goal) → Some(bindings) on success, None on failure / timeout.

Both callbacks take owned values and return 'static futures so that they can be used inside the recursive async implementation without complex higher-ranked lifetime constraints.