Data Compaction and Compression Finite Automata Applications Efficiency Semantic Networks
Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Serdica Journal of Computing, Vol. 2, No 4, (2008), 369p-402p
This paper introduces an encoding of knowledge representation statements
as regular languages and proposes a two-phase approach to
processing of explicitly declared conceptual information. The idea is presented
for the simple conceptual graphs where conceptual pattern search is
implemented by the so called projection operation. Projection calculations
are organised into off-line preprocessing and run-time computations. This
enables fast run-time treatment of NP-complete problems, given that the
intermediate results of the off-line phase are kept in suitable data structures.
The experiments with randomly-generated, middle-size knowledge
bases support the claim that the suggested approach radically improves the
run-time conceptual pattern search.