Knowledge Representation Using a Modified Earley's Algorithm

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.

[1]  George K. Papakonstantinou,et al.  Attribute grammar based theorem prover , 1988 .

[2]  George K. Papakonstantinou,et al.  Attribute-grammar interpreter for inexact reasoning , 1990 .

[3]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[4]  King-Sun Fu,et al.  Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  George K. Papakonstantinou,et al.  A hardware extension of the RISC microprocessor for Attribute Grammar evaluation , 2004, SAC '04.

[6]  Mats Carlsson,et al.  Parallel execution of prolog programs: a survey , 2001, TOPL.

[7]  Frank Vahid,et al.  Embedded system design - a unified hardware / software introduction , 2001 .

[8]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[9]  Yoshimichi Watanabe,et al.  An Attribute Evaluation of Context-Free Languages , 1994, Inf. Process. Lett..

[10]  Robert W. Floyd,et al.  The Syntax of Programming Languages-A Survey , 1964, IEEE Trans. Electron. Comput..

[11]  George K. Papakonstantinou,et al.  An Attribute Grammar Interpreter as a Knowledge Engineering Tool , 1986, Angew. Inform..

[12]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[13]  Jan Maluszynski,et al.  A grammatical view of logic programming , 1988, PLILP.

[14]  James R. Armstrong,et al.  VHDL Design Representation and Synthesis , 2000 .

[15]  Martha Sideri,et al.  Semantically Driven Parsing of Context-Free Languages , 1989, Comput. J..

[16]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[17]  Jukka Paakki,et al.  Attribute grammar paradigms—a high-level methodology in language implementation , 1995, CSUR.

[18]  George K. Papakonstantinou,et al.  Knowledge Representation with Attribute Grammars , 1986, Comput. J..