Knowledge representation using a modified earley's algorithm

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Pavlatos, C en
dc.contributor.author Panagopoulos, I en
dc.contributor.author Papakonstantinou, G en
dc.date.accessioned 2014-03-01T02:42:51Z
dc.date.available 2014-03-01T02:42:51Z
dc.date.issued 2004 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/123456789/31103
dc.subject Attribute Grammar en
dc.subject Embedded System en
dc.subject Hardware Implementation en
dc.subject Knowledge Engineering en
dc.subject Knowledge Representation en
dc.subject Left To Right en
dc.subject Logic Programs en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.other Algorithms en
dc.subject.other Computer science en
dc.subject.other Context free grammars en
dc.subject.other Embedded systems en
dc.subject.other Fuzzy control en
dc.subject.other Knowledge engineering en
dc.subject.other Logic programming en
dc.subject.other Mathematical models en
dc.subject.other Optimization en
dc.subject.other Problem solving en
dc.subject.other Reduced instruction set computing en
dc.subject.other Attribute grammar (AG) en
dc.subject.other Earley's algorithm en
dc.subject.other Hardware parsers en
dc.subject.other Knowledge representation en
dc.title Knowledge representation using a modified earley's algorithm en
heal.type conferenceItem en
heal.identifier.primary 10.1007/978-3-540-24674-9_34 en
heal.identifier.secondary http://dx.doi.org/10.1007/978-3-540-24674-9_34 en
heal.language English en
heal.publicationDate 2004 en
heal.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. en
heal.publisher SPRINGER-VERLAG BERLIN en
heal.journalName Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) en
dc.identifier.doi 10.1007/978-3-540-24674-9_34 en
dc.identifier.isi ISI:000221610800034 en
dc.identifier.volume 3025 en
dc.identifier.spage 321 en
dc.identifier.epage 330 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record