User loginNavigation |
archivesA production rule system matching algorithm with match cost logarithmic wrt the size of the knowledge base (rules + facts)I propose an algorithm to match facts against rule sets (or against fact sets) which has a time complexity logarithmic with respect to the size of the knowledge base, measured in terms of rules + facts in working memory. As far as I am aware, the current state of the art is polynomial, with RETE derivatives. There is a description of this algorithm in a reference implementation I have published, in Python (sorry), whose docs can be checked here: syntreenet in gitlabThanks! |
Browse archivesActive forum topics
|
Recent comments
14 weeks 6 days ago
19 weeks 1 day ago
20 weeks 5 days ago
20 weeks 5 days ago
23 weeks 3 days ago
28 weeks 14 hours ago
28 weeks 16 hours ago
28 weeks 3 days ago
28 weeks 3 days ago
31 weeks 2 days ago