DeepAI AI Chat
Log In Sign Up

Fuzzy Maximum Satisfiability

02/06/2016
by   Mohamed El Halaby, et al.
Cairo University
0

In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to Łukasiewicz logic. The MaxSAT problem for a set of formulae Φ is the problem of finding an assignment to the variables in Φ 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/21/2019

The Fluted Fragment with Transitivity

We study the satisfiability problem for the fluted fragment extended wit...
02/24/2023

Constraint Optimization over Semirings

Interpretations of logical formulas over semirings have applications in ...
02/11/2020

Rapid Top-Down Synthesis of Large-Scale IoT Networks

Advances in optimization and constraint satisfaction techniques, togethe...
11/10/2022

Finding Critical Nodes in Interdependent Networks with SAT and ILP Solvers

Infrastructure systems, such as power systems, often experience cascadin...
07/23/2014

M-best solutions for a class of fuzzy constraint satisfaction problems

The article considers one of the possible generalizations of constraint ...
03/03/2022

An attack on Zarankiewicz's problem through SAT solving

The Zarankiewicz function gives, for a chosen matrix and minor size, the...
01/16/2014

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

Call control features (e.g., call-divert, voice-mail) are primitive opti...