DOI

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.

Original languageEnglish
Title of host publicationProceedings of 2020 23rd International Conference on Soft Computing and Measurements, SCM 2020
EditorsS. Shaposhnikov
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages34-36
Number of pages3
ISBN (Electronic)9781728196923
DOIs
StatePublished - May 2020
Event23rd International Conference on Soft Computing and Measurements, SCM 2020 - St. Petersburg, Russian Federation
Duration: 27 May 2020 → 29 May 2020

Publication series

NameProceedings of 2020 23rd International Conference on Soft Computing and Measurements, SCM 2020

Conference

Conference23rd International Conference on Soft Computing and Measurements, SCM 2020
Country/TerritoryRussian Federation
CitySt. Petersburg
Period27/05/20 → 29/05/20

    Research areas

  • algebraic Bayesian networks, complexity, knowledge pattern, linear programming, local consistency

    Scopus subject areas

  • Computational Mathematics
  • Control and Optimization
  • Computer Science Applications
  • Modelling and Simulation
  • Decision Sciences (miscellaneous)
  • Instrumentation

ID: 88230941