We examine the recently proposed language of Logical Credal Networks, in particular investigating the consequences of various Markov conditions. We introduce the notion of structure for a Logical Credal Network and show that a structure without directed cycles leads to a well-known factorization result. For networks with directed cycles, we analyze the differences between Markov conditions, factorization results, and specification requirements.

翻译：我们研究了近期提出的逻辑置信网络语言，重点探讨了不同马尔可夫条件带来的影响。我们引入了逻辑置信网络的结构概念，并证明无向环结构可导出经典的因子分解结果。针对含向环的网络，我们分析了马尔可夫条件、因子分解结果与规范需求之间的差异。