Quantum Algorithm for Variant Maximum Satisfiability [PDF]
Entropy, 2022 In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that
Abdirahman Alasow +2 more
doaj +2 more sources
A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks. [PDF]
PLoS ONE, 2014 In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network.
Wensheng Guo +4 more
doaj +2 more sources
Augmenting an electronic Ising machine to effectively solve boolean satisfiability [PDF]
Scientific Reports, 2023 With the slowdown of improvement in conventional von Neumann systems, increasing attention is paid to novel paradigms such as Ising machines. They have very different approach to solving combinatorial optimization problems.
Anshujit Sharma +3 more
doaj +2 more sources
Efficient optimization with higher-order Ising machines [PDF]
Nature Communications, 2023 A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables.
Connor Bybee +5 more
doaj +2 more sources
Symmetry in Boolean Satisfiability [PDF]
Symmetry, 2010 This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT) search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints.
exaly +2 more sources
Backjumping for Quantified Boolean Logic satisfiability
Artificial Intelligence, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enrico Giunchiglia +2 more
exaly +4 more sources
Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework [PDF]
PeerJ Computer ScienceThe Boolean satisfiability (SAT) problem exhibits different structural features in various domains. Neural network models can be used as more generalized algorithms that can be learned to solve specific problems based on different domain data than ...
Wenjing Chang, Mengyu Guo, Junwei Luo
doaj +3 more sources
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
Solving Graph Coloring Problem Based on Grover Algorithm [PDF]
Jisuanji kexue, 2023 Grover quantum search algorithm is a famous quantum algorithm designed for unstructured search problems.It can be used to solve problems such as graph coloring and shortest path sorting,and can also effectively decipher cryptosystems.Graph coloring ...
LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan
doaj +1 more source
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Physics Letters B, 2021 We apply Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers in the context of finding chiral heterotic string models with positive cosmological constant from Z2×Z2 orbifolds.
Alon E. Faraggi +3 more
doaj +1 more source