Fuzzy Propositional Configuration Logics

DOI10.1142/S012905412345003XarXiv2106.05041OpenAlexW3172711233MaRDI QIDQ6072402FDOQ6072402

Authors: Paulina Paraponiari 

Publication date: 13 October 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2106.05041

zbMATH Keywords

uncertaintyformal methodsfuzzy logicsoftware architecturesquantitative featurespropositional configuration logics

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx) General logic (03Bxx)

Cites Work

• L-fuzzy sets
• Title not available (Why is that?)
• Fuzzy languages
• Configuration logics: modeling architecture styles
• A mathematical setting for fuzzy logics
• Title not available (Why is that?)
• Weighted propositional configuration logics: a specification language for architectures with quantitative features

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Fuzzy Propositional Configuration Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072402)