rust-rule-engine 1.0.2-alpha

A high-performance rule engine for Rust with RETE-UL algorithm (2-24x faster), CLIPS-inspired features (Template System, Defglobal, Deffacts, Test CE, Conflict Resolution), Parallel Execution
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
//! Backward chaining engine implementation

use super::goal::{Goal, GoalManager, GoalStatus};
use super::search::{DepthFirstSearch, SearchStrategy, SearchResult};
use super::query::{QueryParser, QueryResult, QueryStats, ProofTrace};
use crate::{Facts, KnowledgeBase};
use crate::errors::Result;
use std::sync::Arc;

/// Configuration for backward chaining engine
#[derive(Debug, Clone)]
pub struct BackwardConfig {
    /// Maximum depth for goal search
    pub max_depth: usize,
    
    /// Search strategy to use
    pub strategy: SearchStrategy,
    
    /// Enable memoization of proven goals
    pub enable_memoization: bool,
    
    /// Maximum number of solutions to find
    pub max_solutions: usize,
}

impl Default for BackwardConfig {
    fn default() -> Self {
        Self {
            max_depth: 10,
            strategy: SearchStrategy::DepthFirst,
            enable_memoization: true,
            max_solutions: 1,
        }
    }
}

/// Backward chaining engine for goal-driven reasoning
pub struct BackwardEngine {
    knowledge_base: Arc<KnowledgeBase>,
    config: BackwardConfig,
    goal_manager: GoalManager,
}

impl BackwardEngine {
    /// Create a new backward chaining engine
    pub fn new(kb: KnowledgeBase) -> Self {
        Self {
            knowledge_base: Arc::new(kb),
            config: BackwardConfig::default(),
            goal_manager: GoalManager::default(),
        }
    }
    
    /// Create with custom configuration
    pub fn with_config(kb: KnowledgeBase, config: BackwardConfig) -> Self {
        Self {
            knowledge_base: Arc::new(kb),
            goal_manager: GoalManager::new(config.max_depth),
            config,
        }
    }
    
    /// Update configuration
    pub fn set_config(&mut self, config: BackwardConfig) {
        self.goal_manager = GoalManager::new(config.max_depth);
        self.config = config;
    }
    
    /// Query whether a goal can be proven
    ///
    /// # Example
    ///
    /// ```ignore
    /// let engine = BackwardEngine::new(kb);
    /// let result = engine.query("User.IsVIP == true", &mut facts)?;
    ///
    /// if result.provable {
    ///     println!("User is VIP!");
    /// }
    /// ```
    pub fn query(&mut self, query_str: &str, facts: &mut Facts) -> Result<QueryResult> {
        // Parse query into goal
        let mut goal = QueryParser::parse(query_str)
            .map_err(|e| crate::errors::RuleEngineError::ParseError { message: e })?;

        // Check cache if memoization enabled
        if self.config.enable_memoization {
            if let Some(cached) = self.goal_manager.is_cached(query_str) {
                return Ok(if cached {
                    QueryResult::success(
                        goal.bindings.to_map(), // Convert Bindings to HashMap
                        ProofTrace::from_goal(&goal),
                        QueryStats::default(),
                    )
                } else {
                    QueryResult::failure(vec![], QueryStats::default())
                });
            }
        }

        // Find candidate rules that can prove this goal
        self.find_candidate_rules(&mut goal)?;

        // Execute search strategy
        let search_result = self.execute_search(&mut goal, facts)?;
        
        // Cache result if enabled
        if self.config.enable_memoization {
            self.goal_manager.cache_result(query_str.to_string(), search_result.success);
        }
        
        // Build query result
        let stats = QueryStats {
            goals_explored: search_result.goals_explored,
            rules_evaluated: search_result.path.len(),
            max_depth: search_result.max_depth_reached,
            duration_ms: None,
        };
        
        Ok(if search_result.success {
            QueryResult::success(
                search_result.bindings,
                ProofTrace::from_goal(&goal),
                stats,
            )
        } else {
            QueryResult::failure(self.find_missing_facts(&goal), stats)
        })
    }
    
    /// Find all candidate rules that could prove a goal
    fn find_candidate_rules(&self, goal: &mut Goal) -> Result<()> {
        // In a full implementation, we would:
        // 1. Parse goal pattern
        // 2. Find rules whose conclusions match the goal
        // 3. Add them as candidate rules
        
        // For now, add all rules as candidates
        for rule in self.knowledge_base.get_rules() {
            // Simple check: if rule name or actions might prove this goal
            if self.rule_could_prove_goal(&rule, goal) {
                goal.add_candidate_rule(rule.name.clone());
            }
        }
        
        Ok(())
    }
    
    /// Check if a rule could potentially prove a goal
    fn rule_could_prove_goal(&self, rule: &crate::engine::rule::Rule, goal: &Goal) -> bool {
        // Simple heuristic: check if goal pattern appears in rule actions
        // In a full implementation, this would be more sophisticated
        
        // Check rule name
        if goal.pattern.contains(&rule.name) {
            return true;
        }
        
        // Check actions
        for action in &rule.actions {
            match action {
                crate::types::ActionType::Set { field, .. } => {
                    if goal.pattern.contains(field) {
                        return true;
                    }
                }
                crate::types::ActionType::MethodCall { object, method, .. } => {
                    if goal.pattern.contains(object) || goal.pattern.contains(method) {
                        return true;
                    }
                }
                _ => {}
            }
        }
        
        false
    }
    
    /// Execute the configured search strategy
    fn execute_search(&mut self, goal: &mut Goal, facts: &mut Facts) -> Result<SearchResult> {
        match self.config.strategy {
            SearchStrategy::DepthFirst => {
                let mut dfs = DepthFirstSearch::new(self.config.max_depth, (*self.knowledge_base).clone());
                // Pass KB and facts so search can execute rules
                Ok(dfs.search_with_execution(goal, facts, &self.knowledge_base))
            }
            SearchStrategy::BreadthFirst => {
                // For now, fall back to DFS
                let mut dfs = DepthFirstSearch::new(self.config.max_depth, (*self.knowledge_base).clone());
                Ok(dfs.search_with_execution(goal, facts, &self.knowledge_base))
            }
            SearchStrategy::Iterative => {
                // For now, fall back to DFS
                let mut dfs = DepthFirstSearch::new(self.config.max_depth, (*self.knowledge_base).clone());
                Ok(dfs.search_with_execution(goal, facts, &self.knowledge_base))
            }
        }
    }
    
    /// Find what facts are missing to prove a goal
    fn find_missing_facts(&self, goal: &Goal) -> Vec<String> {
        let mut missing = Vec::new();
        
        // Collect unprovable sub-goals
        self.collect_missing_recursive(goal, &mut missing);
        
        missing
    }
    
    fn collect_missing_recursive(&self, goal: &Goal, missing: &mut Vec<String>) {
        if goal.status == GoalStatus::Unprovable {
            missing.push(goal.pattern.clone());
        }
        
        for sub_goal in &goal.sub_goals {
            self.collect_missing_recursive(sub_goal, missing);
        }
    }
    
    /// Explain why a goal was proven (or not)
    pub fn explain_why(&mut self, query_str: &str, facts: &mut Facts) -> Result<String> {
        let result = self.query(query_str, facts)?;

        if result.provable {
            Ok(format!(
                "Goal '{}' is PROVABLE\nProof trace:\n{:#?}",
                query_str, result.proof_trace
            ))
        } else {
            Ok(format!(
                "Goal '{}' is NOT provable\nMissing facts: {:?}",
                query_str, result.missing_facts
            ))
        }
    }
    
    /// Get the configuration
    pub fn config(&self) -> &BackwardConfig {
        &self.config
    }
    
    /// Get the knowledge base
    pub fn knowledge_base(&self) -> &KnowledgeBase {
        &self.knowledge_base
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::KnowledgeBase;
    use crate::types::Value;
    
    #[test]
    fn test_engine_creation() {
        let kb = KnowledgeBase::new("test");
        let engine = BackwardEngine::new(kb);
        
        assert_eq!(engine.config.max_depth, 10);
        assert_eq!(engine.config.strategy, SearchStrategy::DepthFirst);
    }
    
    #[test]
    fn test_config_customization() {
        let kb = KnowledgeBase::new("test");
        let config = BackwardConfig {
            max_depth: 5,
            strategy: SearchStrategy::BreadthFirst,
            enable_memoization: false,
            max_solutions: 10,
        };
        
        let engine = BackwardEngine::with_config(kb, config);
        assert_eq!(engine.config.max_depth, 5);
        assert_eq!(engine.config.strategy, SearchStrategy::BreadthFirst);
        assert!(!engine.config.enable_memoization);
    }
    
    #[test]
    fn test_query_simple() {
        let kb = KnowledgeBase::new("test");
        let mut engine = BackwardEngine::new(kb);
        let facts = Facts::new();

        // This will fail because no rules, but tests the flow
        let result = engine.query("User.IsVIP == true", &facts);
        assert!(result.is_ok());
    }

    #[test]
    fn test_function_call_condition_len() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Name length > 3, then User.HasLongName = true
        let conditions = ConditionGroup::Single(
            Condition::with_function(
                "len".to_string(),
                vec!["User.Name".to_string()],
                Operator::GreaterThan,
                Value::Number(3.0),
            )
        );
        let actions = vec![ActionType::Set {
            field: "User.HasLongName".to_string(),
            value: Value::Boolean(true),
        }];

        let rule = Rule::new("CheckNameLength".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.Name", Value::String("John".to_string()));

        // Query if User.HasLongName == true
        let result = engine.query("User.HasLongName == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        // Should be provable because "John".len() = 4 > 3
        assert!(query_result.provable, "Query should be provable with len() function");
    }

    #[test]
    fn test_function_call_condition_isempty() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Description is NOT empty, then User.HasDescription = true
        let conditions = ConditionGroup::Single(
            Condition::with_function(
                "isEmpty".to_string(),
                vec!["User.Description".to_string()],
                Operator::Equal,
                Value::Boolean(false),
            )
        );
        let actions = vec![ActionType::Set {
            field: "User.HasDescription".to_string(),
            value: Value::Boolean(true),
        }];

        let rule = Rule::new("CheckDescription".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.Description", Value::String("A great user".to_string()));

        let result = engine.query("User.HasDescription == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        // Should be provable because description is not empty
        assert!(query_result.provable, "Query should be provable with isEmpty() function");
    }

    #[test]
    fn test_test_expression_exists() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup, ConditionExpression};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Email exists, then User.HasEmail = true
        let condition = Condition {
            field: "User.Email".to_string(),  // Required field
            expression: ConditionExpression::Test {
                name: "exists".to_string(),
                args: vec!["User.Email".to_string()],
            },
            operator: Operator::Equal,
            value: Value::Boolean(true),
        };
        let conditions = ConditionGroup::Single(condition);
        let actions = vec![ActionType::Set {
            field: "User.HasEmail".to_string(),
            value: Value::Boolean(true),
        }];

        let rule = Rule::new("CheckEmail".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.Email", Value::String("user@example.com".to_string()));

        let result = engine.query("User.HasEmail == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        // Should be provable because User.Email exists
        assert!(query_result.provable, "Query should be provable with exists test");
    }

    #[test]
    fn test_multifield_count_operation() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup, ConditionExpression};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Orders count > 5, then User.IsFrequentBuyer = true
        let condition = Condition {
            field: "User.Orders".to_string(),  // Required field
            expression: ConditionExpression::MultiField {
                field: "User.Orders".to_string(),
                operation: "count".to_string(),
                variable: None,
            },
            operator: Operator::GreaterThan,
            value: Value::Number(5.0),
        };
        let conditions = ConditionGroup::Single(condition);
        let actions = vec![ActionType::Set {
            field: "User.IsFrequentBuyer".to_string(),
            value: Value::Boolean(true),
        }];

        let rule = Rule::new("CheckFrequentBuyer".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();

        // Create array of 6 orders
        let orders = Value::Array(vec![
            Value::Number(1.0),
            Value::Number(2.0),
            Value::Number(3.0),
            Value::Number(4.0),
            Value::Number(5.0),
            Value::Number(6.0),
        ]);
        facts.set("User.Orders", orders);

        let result = engine.query("User.IsFrequentBuyer == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        // Should be provable because orders.count() = 6 > 5
        assert!(query_result.provable, "Query should be provable with count multifield operation");
    }

    #[test]
    fn test_fact_derivation_basic() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Age > 18, then User.IsAdult = true
        let conditions = ConditionGroup::Single(
            Condition::new(
                "User.Age".to_string(),
                Operator::GreaterThan,
                Value::Number(18.0),
            )
        );
        let actions = vec![ActionType::Set {
            field: "User.IsAdult".to_string(),
            value: Value::Boolean(true),
        }];

        let rule = Rule::new("DetermineAdult".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.Age", Value::Number(25.0));

        // Query will trigger rule execution which should set User.IsAdult
        let result = engine.query("User.IsAdult == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        assert!(query_result.provable, "Fact should be derived by rule action");
    }

    #[test]
    fn test_rule_chaining_two_levels() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup};
        use crate::types::{Operator, ActionType, LogicalOperator};

        let mut kb = KnowledgeBase::new("test");

        // Rule 1: If User.LoyaltyPoints > 100, then User.IsVIP = true
        let conditions1 = ConditionGroup::Single(
            Condition::new(
                "User.LoyaltyPoints".to_string(),
                Operator::GreaterThan,
                Value::Number(100.0),
            )
        );
        let actions1 = vec![ActionType::Set {
            field: "User.IsVIP".to_string(),
            value: Value::Boolean(true),
        }];
        let rule1 = Rule::new("DetermineVIP".to_string(), conditions1, actions1);

        // Rule 2: If User.IsVIP == true AND Order.Amount < 10000, then Order.AutoApproved = true
        let conditions2 = ConditionGroup::Compound {
            left: Box::new(ConditionGroup::Single(
                Condition::new(
                    "User.IsVIP".to_string(),
                    Operator::Equal,
                    Value::Boolean(true),
                )
            )),
            operator: LogicalOperator::And,
            right: Box::new(ConditionGroup::Single(
                Condition::new(
                    "Order.Amount".to_string(),
                    Operator::LessThan,
                    Value::Number(10000.0),
                )
            )),
        };
        let actions2 = vec![ActionType::Set {
            field: "Order.AutoApproved".to_string(),
            value: Value::Boolean(true),
        }];
        let rule2 = Rule::new("AutoApproveVIP".to_string(), conditions2, actions2);

        kb.add_rule(rule1);
        kb.add_rule(rule2);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.LoyaltyPoints", Value::Number(150.0));
        facts.set("Order.Amount", Value::Number(5000.0));

        // Query Order.AutoApproved - should chain through:
        // 1. Check Order.AutoApproved rule (rule2)
        // 2. Needs User.IsVIP == true
        // 3. Check User.IsVIP rule (rule1)
        // 4. Verify User.LoyaltyPoints > 100 (satisfied)
        // 5. Execute rule1 action -> sets User.IsVIP = true
        // 6. Now rule2 conditions satisfied -> sets Order.AutoApproved = true
        let result = engine.query("Order.AutoApproved == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        assert!(query_result.provable, "Query should be provable through 2-level rule chaining");
    }

    #[test]
    fn test_fact_derivation_with_log_action() {
        use crate::engine::rule::{Rule, Condition, ConditionGroup};
        use crate::types::{Operator, ActionType};

        let mut kb = KnowledgeBase::new("test");

        // Rule: If User.Score > 90, log message and set HighScore
        let conditions = ConditionGroup::Single(
            Condition::new(
                "User.Score".to_string(),
                Operator::GreaterThan,
                Value::Number(90.0),
            )
        );
        let actions = vec![
            ActionType::Log {
                message: "High score achieved!".to_string(),
            },
            ActionType::Set {
                field: "User.HasHighScore".to_string(),
                value: Value::Boolean(true),
            }
        ];

        let rule = Rule::new("HighScoreRule".to_string(), conditions, actions);
        kb.add_rule(rule);

        let mut engine = BackwardEngine::new(kb);
        let mut facts = Facts::new();
        facts.set("User.Score", Value::Number(95.0));

        let result = engine.query("User.HasHighScore == true", &facts);
        assert!(result.is_ok());
        let query_result = result.unwrap();

        // Should be provable and log action should have been executed
        assert!(query_result.provable, "Query should be provable with log action");
    }
}