BulDML at Institute of Mathematics and Informatics >
IMI Periodicals >
Serdica Journal of Computing >
2008 >
Volume 2 Number 4 >

Please use this identifier to cite or link to this item:

Title: Conceptual Information Compression and Efficient Pattern Search
Authors: Angelova, Galia
Mihov, Stoyan
Keywords: Data Compaction and Compression
Finite Automata
Semantic Networks
Issue Date: 2008
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 2, No 4, (2008), 369p-402p
Abstract: 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.
ISSN: 1312-6555
Appears in Collections:Volume 2 Number 4

Files in This Item:

File Description SizeFormat
sjc076-vol2-num4-2008.pdf2.9 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License