An Efficient Hardware Implementation for AI Applications

  • Alexandros Dimopoulos
  • Christos Pavlatos
  • Ioannis Panagopoulos
  • George Papakonstantinou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3955)


A hardware architecture is presented, which accelerates the per- formance of intelligent applications that are based on logic programming. The logic programs are mapped on hardware and more precisely on FPGAs (Field Programmable Gate Array). Since logic programs may easily be transformed into an equivalent Attribute Grammar (AG), the underlying model of implementing an embedded system for the aforementioned applications can be that of an AG evaluator. Previous attempts to the same problem were based on the use of two separate components. An FPGA was used for mapping the inference engine and a conventional RISC microprocessor for mapping the unification mechanism and user defined additional semantics. In this paper a new architecture is presented, in order to drastically reduce the number of the required processing elements by a factor of n (length of input string). This fact and the fact of using, for the inference engine, an extension of the most efficient parsing algorithm, allowed us to use only one component i.e. a single FPGA board, eliminating the need for an additional external RISC microprocessor, since we have embedded two “PicoBlaze” Soft Processors into the FPGA. The proposed architecture is suitable for embedded system applications where low cost, portability and low power consumption is of crucial importance. Our approach was tested with numerous examples in order to establish the performance improvement over previous attempts.


Logic Program Field Programmable Gate Array Logic Programming Inference Engine Attribute Evaluation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Russel, S., Norvig, P.: Artificial Intelligence, a modern approach. Prentice-Hall, Englewood Cliffs (1995)zbMATHGoogle Scholar
  2. 2.
    Knuth, D.: Semantics of context free languages. Math. Syst. Theory 2(2), 127–145 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Deransart, P., Maluszynski, J.: A grammatical view of logic programming. MIT Press, Cambridge (1993)zbMATHGoogle Scholar
  4. 4.
    Papakonstantinou, G., Kontos, J.: Knowledge Representation with Attribute Grammars. The Computer Journal 29(3) (1986)Google Scholar
  5. 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. 6.
    Clocksin, W.F., Mellish, C.S.: Programming in PROLOGGoogle Scholar
  7. 7.
    Panagopoulos, I., Pavlatos, C., Papakonstantinou, G.: An Embedded System for Artificial Intelligence Applications. International Journal of Computational Intelligence (2004)Google Scholar
  8. 8.
    Panagopoulos, I., Pavlatos, C., Papakonstantinou, G.: An Embedded Microprocessor for Intelligence Control. Journal of Rob. and Intel. SystemsGoogle Scholar
  9. 9.
    Fu, K.: Syntactic Pattern recognition and Applications. Prentice-Hall, Englewood Cliffs (1982)zbMATHGoogle Scholar
  10. 10.
    Chen, H., Chen, X.: Shape recognition using VLSI Architecture. The International Journal of Pattern Recognition and Artificial Intelligence (1993)Google Scholar
  11. 11.
    Aho, A., Sethi, R., Ullman, J.: Compilers – Principles, Techniques and Tools, pp. 293–296. Addison-Wesley, Reading, MA (1986)zbMATHGoogle Scholar
  12. 12.
    Demers, A., Reps, T., Teitelbaum, T.: Incremental evaluation for attribute grammars with application to syntax-directed editors. In: Conf. Rec. 8th Annu. ACM symp. Principles Programming Languages, January 1981, pp. 415–418 (1981)Google Scholar
  13. 13.
    Pavlatos, C., Panagopoulos, I., Papakonstantinou, G.: A programmable Pipelined Coprocessor for Parsing Applications. In: Workshop on Application Specific Processors (WASP) CODES, Stockholm (September 2004)Google Scholar
  14. 14.
    Chiang, Y., Fu, K.: Parallel parsing algorithms and VLSI implementation for syntactic pattern recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence PAMI-6 (1984)Google Scholar
  15. 15.
    Pavlatos, C., Dimopoulos, A., Papakonstantinou, G.: An Intelligent Embedded System for Control Applications. In: Workshop on Modeling and Control of Complex Systems, Cyprus (2005)Google Scholar
  16. 16.
  17. 17.
    Floyd, R.: The Syntax of Programming Languages-A Survey. IEEE Transactions on Electr. Comp. EC 13(4) (1964)Google Scholar
  18. 18.
    Earley, J.: An efficient context–free parsing algorithm. Communications of the ACM 13, 94–102 (1970)CrossRefzbMATHGoogle Scholar
  19. 19.
    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)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexandros Dimopoulos
    • 1
  • Christos Pavlatos
    • 1
  • Ioannis Panagopoulos
    • 1
  • George Papakonstantinou
    • 1
  1. 1.Dept. of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece

Personalised recommendations