Finding a given number of solutions to a system of fuzzy constraints / Schlesinger, / Flach, / Vodolazskiy. (2018)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (1))

Schlesinger M.I., Flach B., Vodolazskiy E.
Finding a given number of solutions to a system of fuzzy constraints

A minimax modification of a fuzzy constraint satisfaction problem is considered, where constraints determine not whether a given solution is feasible but the numerical value of satisfiability. The algorithm is proposed that finds a given number of solutions with the highest value of satisfiability in polynomial time for a subclass of problems with constraints invariant to some majority operator. It is important that knowing the operator itself is not required. Moreover, it is not necessary to guarantee its existence. For any system of fuzzy constraints, the algorithm either finds a given number of best solutions or declines the problem. The latter is only possible when no such operator exists. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: discrete optimization, invariants, labeling, minimax problems, polymorphisms, Formal logic, Labeling, Optimization, Polymorphism, Polynomial approximation, Polynomials, Discrete optimization, Fuzzy constraint satisfaction problems, Fuzzy-constraint, invariants, Minimax problem, Numerical values, Polynomial-time, Satisfiability, Constraint satisfaction problems


Cite:
Schlesinger M.I., Flach B., Vodolazskiy E. (2018). Finding a given number of solutions to a system of fuzzy constraints. Cybernetics and Systems Analysis, 54 (1), 67-83. doi: https://doi.org/10.1007/s10559-018-0007-2 http://jnas.nbuv.gov.ua/article/UJRN-0000805858 [In Russian].


 

Institute of Information Technologies of VNLU


+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209