Fuzzy Propositional Formulas under the Stable Model Semantics
Author Contacts:
- LRM

Main:23 Pages
3 Figures
Bibliography:3 Pages
Appendix:18 Pages
Abstract
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configurable nonmonotonic reasoning for dynamic domains involving graded truth degrees. We show that several properties of Boolean stable models are naturally extended to this many-valued setting, and discuss how it is related to other approaches to combining fuzzy logic and the stable model semantics.
View on arXiv@article{lee2025_2506.12804, title={ Fuzzy Propositional Formulas under the Stable Model Semantics }, author={ Joohyung Lee and Yi Wang }, journal={arXiv preprint arXiv:2506.12804}, year={ 2025 } }
Comments on this paper