Convex Continuation of a Boolean Function and Its Applications

被引：0
|
作者：
Barotov D.N. [1 ]
机构：
[1] Financial University under the Government of the Russian Federation, Moscow
来源：
Journal of Applied and Industrial Mathematics | 2024年 / 18卷 / 01期
关键词：
Boolean function; convex continuation of a function; global optimization; local minimum; SAT; system of Boolean equations;
D O I：
10.1134/S1990478924010010
中图分类号：
学科分类号：
摘要：
Abstract: A convex continuation of an arbitrary Boolean function to the set is constructed. Moreover, it is proved that for any Boolean function that has no neighboring points on the set, the constructed function is the only totally maximally convex continuation to. Based on this, in particular, it is constructively stated that the problem ofsolving an arbitrary system of Boolean equations can be reduced to the problem of minimizing afunction any local minimum of which in the desired region is a global minimum, and thus for thisproblem the problem of local minima is completely resolved. © Pleiades Publishing, Ltd. 2024.
引用
收藏
页码：1 / 9
页数：8
相关论文
共 50 条
  • [41] Algebraic method to pseudo-Boolean function and its application in pseudo-Boolean optimization
    Li, Zhiqiang
    Song, Jinli
    Xiao, Huimin
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 2468 - 2472
  • [42] Numerical computation of characteristic polynomials of Boolean functions and its applications
    Agrawal, VD
    Lee, D
    Wozniakowski, H
    NUMERICAL ALGORITHMS, 1998, 17 (3-4) : 261 - 278
  • [43] A quantum algorithm for approximating the influences of Boolean functions and its applications
    Hongwei Li
    Li Yang
    Quantum Information Processing, 2015, 14 : 1787 - 1797
  • [44] State Distribution of Markovian Jump Boolean Networks and Its Applications
    Meng, Min
    Xiao, Gaoxi
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (03) : 1815 - 1822
  • [45] Numerical computation of characteristic polynomials of Boolean functions and its applications
    Vishwani D. Agrawal
    David Lee
    Henryk Woźniakowski
    Numerical Algorithms, 1998, 17 : 261 - 278
  • [46] A quantum algorithm for approximating the influences of Boolean functions and its applications
    Li, Hongwei
    Yang, Li
    QUANTUM INFORMATION PROCESSING, 2015, 14 (06) : 1787 - 1797
  • [47] DISJOINT DISJUNCTIVE FORM OF BOOLEAN FUNCTIONS AND ITS APPLICATIONS.
    Takahashi, Naoya
    Mukaidono, Masao
    Systems and Computers in Japan, 1987, 18 (11) : 1 - 11
  • [48] On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI
    Darwiche, Adnan
    Marquis, Pierre
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 72 : 285 - 328
  • [49] Set reachability of Markovian jump Boolean networks and its applications
    Zhang, Qingle
    Feng, Jun-E
    Wang, Biao
    IET CONTROL THEORY AND APPLICATIONS, 2020, 14 (18): : 2914 - 2923
  • [50] On quantifying literals in boolean logic and its applications to explainable AI
    Darwiche A.
    Marquis P.
    Journal of Artificial Intelligence Research, 2021, 72 : 285 - 328
12345