Fuzzy inequational logic

From MaRDI portal
Publication:892182

DOI10.1016/J.IJAR.2015.03.003zbMATH Open1343.03024arXiv1408.2447OpenAlexW2059759229MaRDI QIDQ892182FDOQ892182


Authors: Vilem Vychodil Edit this on Wikidata


Publication date: 18 November 2015

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Abstract: We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes their semantic entailment and provability in graded setting which allows to draw partially true conclusions from partially true assumptions. We follow the Pavelka approach and define general degrees of semantic entailment and provability using complete residuated lattices as structures of truth degrees. We prove the logic is Pavelka-style complete. Furthermore, we present a logic for reasoning about graded if-then rules which is obtained as particular case of the general result.


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Fuzzy inequational logic

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