We introduce and investigate a weighted propositional configuration logic over De Morgan algebras. This logic is able to describe software architectures with quantitative features especially the uncertainty of the interactions that occur in the architecture. We deal with the equivalence problem of formulas in our logic by showing that every formula can be written in a specific form. Surprisingly, there are formulas which are equivalent only over specific De Morgan algebras. We provide examples of formulas in our logic which describe well-known software architectures equipped with quantitative features such as the uncertainty and reliability of their interactions.

中文翻译：

---

模糊命题配置逻辑

我们引入并研究了德摩根代数上的加权命题配置逻辑。这种逻辑能够描述具有定量特征的软件架构，尤其是架构中发生的交互的不确定性。我们通过证明每个公式都可以写成特定的形式来处理逻辑中公式的等价问题。令人惊讶的是，有些公式仅在特定的德摩根代数上等效。我们提供了逻辑中的公式示例，这些公式描述了具有定量特征（例如其交互的不确定性和可靠性）的众所周知的软件架构。