Fuzzy Maximum Satisfiability
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Fuzzy Answer Set Computation via Satisfiability Modulo Theories
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to com…
Logical Fuzzy Optimization
We present a logical framework to represent and reason about fuzzy optimization problems based on fuzzy answer set optimization programming. This is accomplished by allowing fuzzy optimization aggregates, e.g., minimum a…
An landcover fuzzy logic classification by maximumlikelihood
In present days remote sensing is most used application in many sectors. This remote sensing uses different images like multispectral, hyper spectral or ultra spectral. The remote sensing image classification is one of t…
ClassificationGeneral Classificationimage-classificationImage Classification+1New Hybrid Maximum Power Point Tracking Methods for Fuel Cell using Artificial Intelligent
In this paper, two maximum power point tracking (MPPT) methods for Fuel Cell (FC) systems based on Adaptive Neuro-Fuzzy Inference Systems (ANFIS) and Imperialist Competitive Algorithm trained Neural Network (ICANN) are p…
Point TrackingCertifying Pareto-Optimality in Multi-Objective Maximum Satisfiability
Due to the wide employment of automated reasoning in the analysis and construction of correct systems, the results reported by automated reasoning engines must be trustworthy. For Boolean satisfiability (SAT) solvers - a…