Results 81 to 90 of about 263 (134)
A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
International Journal of Computational Intelligence Systems, 2017 Clause learning is the key component of modern SAT solvers, while conflict analysis based on the implication graph is the mainstream technology to generate the learnt clauses.
Qingshan Chen +3 more
doaj +1 more source
Efficient Analog Circuits for Boolean Satisfiability
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2018 9 pages, 9 Figures, 1 Table. Added journal info in version 2: IEEE Transactions on Very Large Scale Integration Systems (TVLSI) vol 26, No 1, January 2018, pp 155-167.
Xunzhao Yin +5 more
openaire +3 more sources
Optimization of Boolean satisfiability solver by caching intermediate results
Труды Института системного программирования РАН, 2018 Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration.
S. Vartanov, D. Sidorov
doaj
MULTIPLE FOLDING OF REGULAR STRUCTURES VIA SOLVING LOGIC EQUATIONS
Informatika, 2016 The problem under consideration is to reduce the area of the layout of regular VLSI structures by means of their multiple folding. The method of solving the key problem of multiple folding, which is implementability checking of the folding set, is ...
L. D. Cheremisinova
doaj
The Boolean Satisfiability Problem
, 2020 The Boolean Satisfiability Problem is also the first problem proven to be NP-complete. A problem is NP-complete if it belongs to the set (or "class" if you prefer) of the hardest problems in NP-hardest in the sense that every problem ever exists in NP can be reduced to them. (Thus being able to solve a NP-complete problem is equivalent to being able to
openaire +1 more source
Toward Optimal Multi-Agent Robot and Lift Schedules via Boolean Satisfiability
MathematicsAs a multirobot system grows in its number of agents, contention over shared resources poses a more significant risk of deadlock and operational deficiencies. When integrating with buildings, one of the most common pieces of equipment that robots have to
Arjo Chakravarty +3 more
doaj +1 more source
FIMA: A Scalable Ferroelectric Compute-in-Memory Annealer for Accelerating Boolean Satisfiability
IEEE Journal on Exploratory Solid-State Computational Devices and CircuitsIn-memory compute kernels present a promising approach for addressing data-centric workloads. However, their scalability—particularly for computationally intensive tasks solving combinatorial optimization problems such as Boolean satisfiability ...
Mohammad Khairul Bashar +7 more
doaj +1 more source
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX QuantumOne of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
Satisfiability in intuitionistic fuzzy logic with realistic tautology
Kuwait Journal of Science, 2018 Any variable in Intuitionistic Fuzzy Logic (IFL) is either a Realistic Fuzzy Tautology (RFT) with a Truth exceeding one half, or a non-Realistic Fuzzy Tautology (nRFT) with a Truth less than or equal to one half.
Ali Muhammad Rushdi +3 more
doaj