Abstract

A forward reasoning engine capable of relevant reasoning is an indispensable component in many advanced knowledge-based systems with purposes of discovery or prediction. Any forward reasoning engine has to deal with duplication checking of intermediate results that is the most time-consuming process in forward reasoning. Therefore, to decrease execution time of forward reasoning engines is a crucial issue for their successful applications. This paper presents a fast algorithm for duplication checking process in forward reasoning engines, analyzes its time and space complexities, and shows its effectiveness by some experimental results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call