User loginNavigation |
A 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! By Enrique Perez Arnaud at 2019-07-06 21:13 | LtU Forum | previous forum topic | next forum topic | other blogs | 3918 reads
|
Browse archives
Active forum topics |
Recent comments
27 weeks 2 days ago
27 weeks 2 days ago
27 weeks 2 days ago
49 weeks 4 days ago
1 year 1 week ago
1 year 3 weeks ago
1 year 3 weeks ago
1 year 6 weeks ago
1 year 10 weeks ago
1 year 10 weeks ago