SATFuL solves fuzzy propositional satisfiability by reducing it to MINLP, handling major fuzzy logics in one framework and showing competitive results on Lukasiewicz and Product logics.
Artifi- cial Intelligence275, 252–278 (2019)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
SATFuL solves fuzzy propositional satisfiability by reducing it to MINLP, handling major fuzzy logics in one framework and showing competitive results on Lukasiewicz and Product logics.