1. A. L. Tulup’ev, D. M. Stolyarov, and M. V. Mentyukov, “Representation of the local and global structure of a Bayesian algebraic network in Java applications,” Tr. SPIIRAN, No. 5, 71–99 (2007).
2. V. V. Oparin and A. L. Tulup’ev, “Synthesis of a joint graph with a minimum number of edges: Formalization of the algorithm and analysis of its correctness,” Tr. SPIIRAN, No. 11, 142–157 (2009).
3. A. L. Tulup’ev, A. V. Sirotkin, and S. I. Nikolenko, Bayesian Belief Networks: Logical Probabilistic Inference in Acyclic Directed Graphs (S.-Peterb. Gos. Univ., St. Petersburg, 2009) [in Russian].
4. A. A. Fil’chenkov, “The power of the set of minimal joint graphs,” Inf.-Upr. Sist., No. 2, 13–17 (2013).
5. V. V. Oparin, A. A. Fil’chenkov, A. V. Sirotkin, and A. L. Tulup’ev, “Matroid representation of a family of joint graphs over a set of knowledge fragments,” Nauchno-Tekh. Vestn. Inf. Tekhnol., Mekh. Opt., No. 4, 73–76 (2010).