Computational complexity of traceability recognition configurations
UDC
510.58 681.142.2EDN
MDXANXAbstract
This paper presents algorithms testing possibility of c- and p-tracing between configurations of abstract knowledge spaces at n2 time, measured by quantity of vertex marking comparisons and structural representations.
Keywords:
semantic structure, tracing of structures, algorithm complexityReferences
- Костенко К.И. Сжатия конфигураций в пространствах знаний // Экологический вестник научных центров Черноморского экономического сотрудничества. 2008, №4. С. 26-33.
- Baader F. Logic-Based Knowledge Representation // Artificial intelligence today. 1999, LNAI 1600. P. 13-41.
- Gupta A., Nashimura N. Finding largest subtrees and smallest supertrees // Algorithmica. 1998. Vol. 21. P. 183-210.
- Ахо А., Хопрокрофт Д., Ульман Д. Структуры данных и алгоритмы. М.: Вильямс, 2003. 382 с.
Downloads
Download data is not yet available.
Downloads
Dates
Submitted
March 10, 2010
Accepted
March 13, 2010
Published
March 22, 2010
How to Cite
[1]
Kostenko, K.I., Computational complexity of traceability recognition configurations. Ecological Bulletin of Research Centers of the Black Sea Economic Cooperation, 2010, № 1, pp. 42–48.
License
Copyright (c) 2010 Костенко К.И.
This work is licensed under a Creative Commons Attribution 4.0 International License.
