{"title":"代数贝叶斯网络:一致性检验的复杂性","authors":"A. Maksimov, A. Tulupyev, A. Zavalishin","doi":"10.1109/SCM50615.2020.9198771","DOIUrl":null,"url":null,"abstract":"One of the primary tasks arising in the theory of algebraic Bayesian networks is the task of checking and maintaining the consistency of a knowledge pattern. Now, there are algorithms for solving this problem, but in computer science and programming, it is extremely important to understand the computational complexity of the methods used. This paper is devoted to estimating the number of steps of these algorithms.","PeriodicalId":169458,"journal":{"name":"2020 XXIII International Conference on Soft Computing and Measurements (SCM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic Bayesian Networks: the Complexity of Consistency Checking\",\"authors\":\"A. Maksimov, A. Tulupyev, A. Zavalishin\",\"doi\":\"10.1109/SCM50615.2020.9198771\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the primary tasks arising in the theory of algebraic Bayesian networks is the task of checking and maintaining the consistency of a knowledge pattern. Now, there are algorithms for solving this problem, but in computer science and programming, it is extremely important to understand the computational complexity of the methods used. This paper is devoted to estimating the number of steps of these algorithms.\",\"PeriodicalId\":169458,\"journal\":{\"name\":\"2020 XXIII International Conference on Soft Computing and Measurements (SCM)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 XXIII International Conference on Soft Computing and Measurements (SCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCM50615.2020.9198771\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 XXIII International Conference on Soft Computing and Measurements (SCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCM50615.2020.9198771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algebraic Bayesian Networks: the Complexity of Consistency Checking
One of the primary tasks arising in the theory of algebraic Bayesian networks is the task of checking and maintaining the consistency of a knowledge pattern. Now, there are algorithms for solving this problem, but in computer science and programming, it is extremely important to understand the computational complexity of the methods used. This paper is devoted to estimating the number of steps of these algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
