Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Trudy SPIIRAN, 2010, Issue 15, Pages 162–192 (Mi trspy414)  
This article is cited in 4 scientific papers (total in 4 papers)

Algebraic bayesian networks reconciliation: computational complexity

A. V. Sirotkin

St. Petersburg Institute for Informatics and Automation of RAS
Full-text PDF (829 kB) Citations (4)
References:
PDF
HTML
Abstract: The paper describes an algorithms lgebraic bayesian networks reconciliation. We prove correctnes of this algorithms and provide computational comlexeti estimates.
Keywords: algorithm, algebraic Bayesian network, consistency, probabilistic logic, knowledge patterns base.
Received: 27.12.2010
Document Type: Article
Language: Russian
Citation: A. V. Sirotkin, “Algebraic bayesian networks reconciliation: computational complexity”, Tr. SPIIRAN, 15 (2010), 162–192
Citation in format AMSBIB
\Bibitem{Sir10}
\by A.~V.~Sirotkin
\paper Algebraic bayesian networks reconciliation: computational complexity
\jour Tr. SPIIRAN
\yr 2010
\vol 15
\pages 162--192
\mathnet{http://mi.mathnet.ru/trspy414}
Linking options:
  • https://www.mathnet.ru/eng/trspy414
  • https://www.mathnet.ru/eng/trspy/v15/p162
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Informatics and Automation
    Statistics & downloads:
    Abstract page:182
    Full-text PDF :104
    References:35
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024