  We introduce and investigate a weighted propositional configuration logic
over De Morgan algebras. This logic is able to describe software architectures
with quantitative features such as the uncertainty of the interactions that
occur in the architecture. We deal with the equivalence problem of formulas in
our logic by proving that every formula can be written in a specific form. To
our surprise, 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.
