Skip to main content

A Memory-Efficient Algorithm with Level-Order Unary Degree Sequence for Forward Reasoning Engines

  • Conference paper
  • First Online:
  • 3086 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10751))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cheng, J.: Entailment calculus as the logical basis of automated theorem finding in scientific discovery. In: Raul, V. (ed.) Systematic Methods of Scientific Discovery: Papers from the 1995 Spring Symposium, pp. 105–110. AAI Press (1995)

    Google Scholar 

  2. Cheng, J.: A strong relevant logic model of epistemic processes in Scientific discovery. In: Kawaguchi, E., et al. (eds.) Information Modeling and Knowledge Bases XI. Frontiers in Artificial Intelligence and Applications, vol. 61, pp. 136–159. IOS Press, Amsterdam (2000)

    Google Scholar 

  3. Cheng, J., Nara, S., Goto, Y.: FreeEnCal: a forward reasoning engine with general-purpose. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007. LNCS (LNAI), vol. 4693, pp. 444–452. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74827-4_56

    Chapter  Google Scholar 

  4. Fredkin, E.: Trie memory. Commun. ACM 3(9), 490–499 (1960)

    Article  Google Scholar 

  5. Gao, H., Goto, Y., Cheng, J.: A systematic methodology for automated theorem finding. Theoret. Comput. Sci. 554, 2–21 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on FOCS 1989, pp. 549–554 (1989)

    Google Scholar 

  7. Koyanagi, T., Yoshida, I., Unno, Y., Shinjo, Y.: Method to build filters for online building of LOUDS trie. In: Computer System Symposium 2011, pp. 33–41 (2011). (in Japanese)

    Google Scholar 

  8. Koh, T., Goto, Y., Cheng, J.: A fast duplication checking algorithm for forward reasoning engines. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008. LNCS (LNAI), vol. 5178, pp. 499–507. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85565-1_62

    Chapter  Google Scholar 

  9. Koh, T., Goto, Y., Cheng, J.: A fast algorithm for derivation process in forward reasoning engines. Int. J. Comput. Sci. 4(3), 219–231 (2010)

    Google Scholar 

  10. Kudo, T., Hanaoka, T., Mukai, J., Tabata, Y., Komatsu, H.: Efficient dictionary and language model compression for input method editor. In: Workshop on Advances in Text Input Method, Chiang Mai, Thailand, pp. 19–25 (2011)

    Google Scholar 

  11. Yan, J., Wagatsuma, K., Gao, H., Cheng, J.: A formal analysis method with reasoning for cryptographic protocols. In: 12th International Conference on Computational Intelligence and Security, Wuxi, China, pp. 566–570 (2016)

    Google Scholar 

  12. Wagatsuma, K., Harada, T., Anze, S., Goto, Y., Cheng, J.: A supporting tool for spiral model of cryptographic protocol design with reasoning-based formal analysis. In: Park, J.J., Chao, H.-C., Arabnia, H., Yen, N.Y. (eds.) Advanced Multimedia and Ubiquitous Engineering. LNEE, vol. 354, pp. 25–32. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-47895-0_4

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuichi Goto .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hiidome, H., Goto, Y., Cheng, J. (2018). A Memory-Efficient Algorithm with Level-Order Unary Degree Sequence for Forward Reasoning Engines. In: Nguyen, N., Hoang, D., Hong, TP., Pham, H., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2018. Lecture Notes in Computer Science(), vol 10751. Springer, Cham. https://doi.org/10.1007/978-3-319-75417-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75417-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75416-1

  • Online ISBN: 978-3-319-75417-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics