@ARTICLE{Dulin199743,
author={Dulin, S.K. and Kiselev, I.A.},
title={Knowledge base simulation in document databases},
journal={Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya},
year={1997},
volume={36},
number={5},
pages={43-47},
note={cited By 0},
url={https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031224804&partnerID=40&md5=375562a17f3304c623a4fb59c15c2129},
affiliation={Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation},
abstract={One of the most contemporary systems based on semiotic modeling is the active knowledge base supplied with a special concordance mechanism of structural consistency. Such method is especially actual when we deal with different document databases, where rule records do not have any structure, and relations between them are hidden. This paper covers some problems of creating models of subject area and deals with an active knowledge base condition considered by means of connections structure analysis of knowledge base components. Thereby, the dominant attribute of any component is supposed to be the connections structure of knowledge base component (object). A set of objects with connections that have a binary existence estimate is examined. Consonant, dissonant, and assonant sets are distinguished, depending on the satisfiability of the consonance criterion. An algorithm is proposed and realized for reducing assonant and dissonant sets to a consonance state with minimum expenditures in the sense of the general number variable estimates of the connections. Interactive systems DISSON and RESTRUCTOR have been developed to realize this algorithm for consistency of knowledge base components.},
correspondence_address1={Dulin, S.K.; Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation},
issn={00023388},
coden={IATKA},
language={Russian},
abbrev_source_title={Izv Akad Nauk Teh Kibern},
document_type={Article},
source={Scopus},
}

{"_id":"7GH9jE7gvuwrHT9sa","bibbaseid":"dulin-kiselev-knowledgebasesimulationindocumentdatabases-1997","author_short":["Dulin, S.","Kiselev, I."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Dulin"],"firstnames":["S.K."],"suffixes":[]},{"propositions":[],"lastnames":["Kiselev"],"firstnames":["I.A."],"suffixes":[]}],"title":"Knowledge base simulation in document databases","journal":"Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya","year":"1997","volume":"36","number":"5","pages":"43-47","note":"cited By 0","url":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031224804&partnerID=40&md5=375562a17f3304c623a4fb59c15c2129","affiliation":"Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation","abstract":"One of the most contemporary systems based on semiotic modeling is the active knowledge base supplied with a special concordance mechanism of structural consistency. Such method is especially actual when we deal with different document databases, where rule records do not have any structure, and relations between them are hidden. This paper covers some problems of creating models of subject area and deals with an active knowledge base condition considered by means of connections structure analysis of knowledge base components. Thereby, the dominant attribute of any component is supposed to be the connections structure of knowledge base component (object). A set of objects with connections that have a binary existence estimate is examined. Consonant, dissonant, and assonant sets are distinguished, depending on the satisfiability of the consonance criterion. An algorithm is proposed and realized for reducing assonant and dissonant sets to a consonance state with minimum expenditures in the sense of the general number variable estimates of the connections. Interactive systems DISSON and RESTRUCTOR have been developed to realize this algorithm for consistency of knowledge base components.","correspondence_address1":"Dulin, S.K.; Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation","issn":"00023388","coden":"IATKA","language":"Russian","abbrev_source_title":"Izv Akad Nauk Teh Kibern","document_type":"Article","source":"Scopus","bibtex":"@ARTICLE{Dulin199743,\r\nauthor={Dulin, S.K. and Kiselev, I.A.},\r\ntitle={Knowledge base simulation in document databases},\r\njournal={Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya},\r\nyear={1997},\r\nvolume={36},\r\nnumber={5},\r\npages={43-47},\r\nnote={cited By 0},\r\nurl={https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031224804&partnerID=40&md5=375562a17f3304c623a4fb59c15c2129},\r\naffiliation={Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation},\r\nabstract={One of the most contemporary systems based on semiotic modeling is the active knowledge base supplied with a special concordance mechanism of structural consistency. Such method is especially actual when we deal with different document databases, where rule records do not have any structure, and relations between them are hidden. This paper covers some problems of creating models of subject area and deals with an active knowledge base condition considered by means of connections structure analysis of knowledge base components. Thereby, the dominant attribute of any component is supposed to be the connections structure of knowledge base component (object). A set of objects with connections that have a binary existence estimate is examined. Consonant, dissonant, and assonant sets are distinguished, depending on the satisfiability of the consonance criterion. An algorithm is proposed and realized for reducing assonant and dissonant sets to a consonance state with minimum expenditures in the sense of the general number variable estimates of the connections. Interactive systems DISSON and RESTRUCTOR have been developed to realize this algorithm for consistency of knowledge base components.},\r\ncorrespondence_address1={Dulin, S.K.; Computer Cent of the Russian Acad of, Sciences, Moscow, Russian Federation},\r\nissn={00023388},\r\ncoden={IATKA},\r\nlanguage={Russian},\r\nabbrev_source_title={Izv Akad Nauk Teh Kibern},\r\ndocument_type={Article},\r\nsource={Scopus},\r\n}\r\n\r\n","author_short":["Dulin, S.","Kiselev, I."],"key":"Dulin199743","id":"Dulin199743","bibbaseid":"dulin-kiselev-knowledgebasesimulationindocumentdatabases-1997","role":"author","urls":{"Paper":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031224804&partnerID=40&md5=375562a17f3304c623a4fb59c15c2129"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bio.pnpi.nrcki.ru/wp-content/uploads/2019/12/lbm_2019_10.txt","dataSources":["YYLjupmCazkNqWNEJ"],"keywords":[],"search_terms":["knowledge","base","simulation","document","databases","dulin","kiselev"],"title":"Knowledge base simulation in document databases","year":1997}