Fuzzy Maximum Satisfiability
Logic in Computer Science
2018-06-12 v1 Artificial Intelligence
Computational Complexity
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.
Keywords
Cite
@article{arxiv.1602.02211,
title = {Fuzzy Maximum Satisfiability},
author = {Mohamed El Halaby and Areeg Abdalla},
journal= {arXiv preprint arXiv:1602.02211},
year = {2018}
}
Comments
10 pages