Abstract
A forward reasoning engine is an indispensable component in many advanced knowledge-based systems with purposes of creation, discovery, or prediction. Time-efficiency and memory-efficiency are crucial issues for any forward reasoning engine. FreeEnCal is a forward reasoning engine for general-purpose, and has been used for several applications, e.g., automated theorem finding. To improve time-efficiency, current implementation of FreeEnCal uses “trie”, which is a kind of tree structure, to store all logical formulas that are given or deduced in FreeEnCal. However, the implementation is not so memory-efficient from view point of applications of FreeEnCal. The paper presents a memory-efficient algorithm of FreeEnCal, and shows theoretical evaluation of the algorithm. The algorithm uses level-order unary degree sequence (LOUDS) that is a kind of succinct data structures and is used to represent tree structures concisely. By using LOUDS to construct trie in FreeEnCal, we can improve memory-efficiency of FreeEnCal.
Sign-in/Register to access full text options 
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
