Skip to main content

Knowledge Representation Using a Modified Earley’s Algorithm

  • Conference paper
  • 1359 Accesses

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

Abstract

Attribute grammars (AGs) have been proven to be valuable tools in knowledge engineering applications. In this paper, we formalize knowledge representation problems in their AG equivalent form and we extend the Earley’s parsing algorithm in order to evaluate simultaneously attributes based on semantic rules related to logic programming. Although Earley’s algorithm can not be extended to handle attribute evaluation computations for all possible AGs, we show that the form of AGs created for equivalent logic programs and the related attribute evaluation rules are such that allow their use for knowledge representation. Hence, a fast one-pass left to right AG evaluator is presented that can effectively be used for logic programs. We also suggest a possible software/hardware implementation for the proposed approach based on existing hardware parsers for Earley’s algorithm, which work in coordination with a conventional RISC microprocessor and can assist in the creation of small-scale applications on intelligent embedded systems with optimized performance.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Russel, S., Norvig, P.: Artificial Intelligence, a modern approach. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  2. Paaki, J.: Attribute Grammar Paradigms – A high level methodology in language implementation. ACM Computing Surveys 27(2) (1995)

    Google Scholar 

  3. Deransart, P., Maluszynski, J.: A grammatical view of logic programming. MIT Press, Cambridge (1993)

    MATH  Google Scholar 

  4. Papakonstantinou, G., Kontos, J.: Knowledge Representation with Attribute Grammars. The Computer Journal 29(3) (1986)

    Google Scholar 

  5. Papakonstantinou, G., Moraitis, C., Panayiotopoulos, T.: An attribute grammar interpreter as a knowledge engineering tool. Applied Informatics 9/86, 382–388 (1986)

    Google Scholar 

  6. Knuth, D.: Semantics of context free languages. Math. Syst. Theory 2(2), 127–145 (1971)

    Article  MathSciNet  Google Scholar 

  7. Earley, J.: An efficient context–free parsing algorithm. Communications of the ACM 13, 94–102 (1970)

    Article  MATH  Google Scholar 

  8. Graham, S.L., Harrison, M.A., Ruzzo, W.L.: An Improved context – free Recognizer. ACM Trans. on Programming Languages and System 2(3), 415–462 (1980)

    Article  MATH  Google Scholar 

  9. Chiang, Y., Fu, K.: Parallel parsing algorithms and VLSI implementation for syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-6 (1984)

    Google Scholar 

  10. Tokuda, T., Watanabe, Y.: An attribute evaluation of context-free languages. Information Processing Letters 57, 91–98 (1994)

    Article  Google Scholar 

  11. Pavlatos, C., Koulouris, A., Papakonstantinou, G.: Hardware Implementation of Syntactic Pattern Recognition Algorithms. In: IASTED International Conference on Signal Processing and Pattern Analysis (SPPRA), pp. 360–365 (2003)

    Google Scholar 

  12. Panagopoulos, I., Pavlatos, C., Papakonstantinou, G.: A hardware extension of the RISC mocroprocessor for attribute grammar evaluation. In: ACM Conference, SAC 2004, Cyprus (2004) (to be published)

    Google Scholar 

  13. Gupta, G., Pontelli, E.: Parallel execution of prolog programs: a survey. Journal of Programming Languages and Systems 23(4), 472–602 (2001)

    Article  Google Scholar 

  14. Karlsson, R.: A High Performance OR-parallel Prolog System. PhD thesis, The Royal Institute of Technology, Stockholm (1992)

    Google Scholar 

  15. Vahid, F., Givargis, T.: Embedded System Design: A Unified Hardware/Software Introduction. Wiley, Chichester (2002)

    Google Scholar 

  16. Floyd, R.: The Syntax of Programming Languages-A Survey. IEEE Transactions on Electr. Comp. EC-13(4) (1964)

    Google Scholar 

  17. Sideri, M., Efremidis, S., Papakonstantinou, G.: Semantically driven parseing of CFG. The computer Journal 32(1), 91–98 (1994)

    Article  Google Scholar 

  18. Armstrong, J., Gray, G.: VHDL Design: Representation and Synthesis, 2nd edn. Prentice Hall, Englewood Cliffs (2000)

    Google Scholar 

  19. Panayiotopoulos, T., Papakonstantinou, G., Stamatopoulos, G.: Attribute Grammar theorem proven. Information and Software Technology 30(9), 553–560 (1988)

    Article  Google Scholar 

  20. Panayiotopoulos, T., Papakonstantinou, G., Sgouros, N.: An attribute grammar interpeter for inexact reasoning. Information and Software Technology 32(5), 347–356 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pavlatos, C., Panagopoulos, I., Papakonstantinou, G. (2004). Knowledge Representation Using a Modified Earley’s Algorithm. In: Vouros, G.A., Panayiotopoulos, T. (eds) Methods and Applications of Artificial Intelligence. SETN 2004. Lecture Notes in Computer Science(), vol 3025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24674-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24674-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21937-8

  • Online ISBN: 978-3-540-24674-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics