TL;DR
This paper extends the MaxSAT problem to Lukasiewicz logic, proposing three encoding methods to optimize satisfaction in fuzzy logic, enabling applications in vague and imprecise optimization scenarios.
Contribution
It introduces a fuzzy MaxSAT framework with three novel encoding approaches: DLRs, MILP, and WCSP, expanding MaxSAT to fuzzy logic contexts.
Findings
Proposes three encoding methods for fuzzy MaxSAT.
Demonstrates applicability to optimization problems with vagueness.
Extends MaxSAT framework to Lukasiewicz logic.
Abstract
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to {\L}ukasiewicz logic. The MaxSAT problem for a set of formulae {\Phi} is the problem of finding an assignment to the variables in {\Phi} that satisfies the maximum number of formulae. Three possible solutions (encodings) are proposed to the new problem: (1) Disjunctive Linear Relations (DLRs), (2) Mixed Integer Linear Programming (MILP) and (3) Weighted Constraint Satisfaction Problem (WCSP). Like its Boolean counterpart, the extended fuzzy MaxSAT will have numerous applications in optimization problems that involve vagueness.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.