## User login## Navigation |
## archives## 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! |
## Browse archives## Active forum topics |

## Recent comments

18 hours 6 min ago

20 hours 40 min ago

22 hours 12 min ago

22 hours 54 min ago

1 day 11 hours ago

1 day 14 hours ago

1 day 18 hours ago

1 day 19 hours ago

2 days 40 min ago

2 days 10 hours ago