Struct LogicSolver 

pub struct LogicSolver { /* private fields */ }

Logic solver with semantic integration

Implementations

impl LogicSolver

pub fn new(config: SolverConfig) -> Result<Self>

Create a new logic solver

pub fn with_defaults() -> Result<Self>

Create with default configuration

pub fn add_fact(&mut self, fact: Predicate, cid: Cid) -> Result<()>

Add a fact to the knowledge base and index it

pub fn add_rule(&mut self, head: Predicate, body: Vec<Predicate>) -> Result<()>

Add a rule to the knowledge base

pub fn find_similar_predicates( &self, query: &Predicate, k: usize, ) -> Result<Vec<(Cid, Predicate, f32)>>

Find similar predicates using semantic search

pub fn query(&self, goal: &Predicate) -> Result<Vec<Substitution>>

Query using backward chaining with semantic relevance

pub fn query_with_depth( &self, goal: &Predicate, max_depth: usize, ) -> Result<Vec<Substitution>>

Query with depth limit and semantic guidance

pub fn backward_chain( &self, goal: &Predicate, ) -> Result<Vec<(Substitution, f32)>>

Perform backward chaining with semantic search fallback

This combines traditional backward chaining with semantic search:

1. Try exact unification first
2. If that fails, search for similar predicates
3. Use similarity scores to rank results

pub fn would_cycle(&self, goal: &Predicate, _depth: usize) -> bool

Check if a query would create a cycle

pub fn stats(&self) -> SolverStats

Get knowledge base statistics

pub fn clear(&mut self)

Clear all data