Results 1 to 10 of about 20,200 (225)
Genetic-fuzzy approach to the Boolean satisfiability problem
IEEE Transactions on Evolutionary Computation, 2002 This study is concerned with the Boolean satisfiability (SAT) problem and its solution in setting a hybrid computational intelligence environment of genetic and fuzzy computing. In this framework, fuzzy sets realize an embedding principle meaning that original two-valued (Boolean) functions under investigation are extended to their continuous ...
Giancarlo Succi, Witold Pedrycz
exaly +5 more sources
Polynomial Time Algorithm for Boolean Satisfiability Problem [PDF]
CoRR, 2023 This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a special covering for a set under the special decomposition of this set and vice versa.
Stepan G. Margaryan
openalex +3 more sources
Classical and Quantum Algorithms for the Boolean Satisfiability Problem [PDF]
CoRR, 2015 This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of their properties and the main result is that the problem has not an efficient algorithm (NP is not P).
Carlos Barrón-Romero
openalex +3 more sources
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 Quantum-Inspired Classical Solver for Boolean k-Satisfiability\n Problems [PDF]
2021 IEEE International Conference on Quantum Computing and Engineering (QCE), 2021 7 pages, 1 ...
S. Andrew Lanham, Brian R. La Cour
+6 more sources
Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem [PDF]
Mathematics, 2023 The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness.
Zhidong Zhang
doaj +2 more sources
Machine Learning Methods in Solving the Boolean Satisfiability Problem [PDF]
Machine Intelligence Research, 2022 This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the help of machine learning techniques. Despite the great success of modern SAT solvers to solve large industrial instances, the design of handcrafted heuristics is time-consuming and empirical. Under the circumstances,
Wenxuan Guo +5 more
openalex +3 more sources
The Boolean SATisfiability Problem in Clifford algebra [PDF]
Theoretical Computer Science, 2019 We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
Marco Budinich
exaly +4 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +4 more sources
The Boolean SATisfiability Problem and the orthogonal group $O(n)$ [PDF]
, 2019 We explore the relations between the Boolean Satisfiability Problem with $n$ literals and the orthogonal group $O(n)$ and show that all solutions lie in the compact and disconnected real manifold of dimension $n (n-1)/2$ of this group.Comment: 11 pages ...
Budinich, Marco
core +2 more sources