Results 31 to 40 of about 12,229,216 (240)
An optimization approach for the satisfiability problem
Applied Computing and Informatics, 2015 We describe a new approach for solving the satisfiability problem by geometric programming. We focus on the theoretical background and give details of the algorithmic procedure. The algorithm is provably efficient as geometric programming is in essence a
S. Noureddine
doaj +1 more source
A New Method for 3-Satisfiability Problem Phase Transition on Structural Entropy
IEEE Access, 2021 The phenomenon of phase transition is an important property of the satisfiability (SAT) problem. It not only determines the difficulty of solving the problem, but also plays an important role in designing fast solving algorithms.
Qingwen Lin, Xiaofeng Wang, Jin Niu
doaj +1 more source
Evolutionary Algorithms for the Satisfiability Problem [PDF]
Evolutionary Computation, 2002 Several evolutionary algorithms have been proposed for the satisfiability problem. We review the solution representations suggested in literature and choose the most promising one the bit string representation for further evaluation. An empirical comparison on commonly used benchmarks is presented for the most successful evolutionary algorithms and ...
Gottlieb, J., Marchiori, E., Rossi, C.
openaire +3 more sources
A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem
AAAI Conference on Artificial Intelligence, 2017 We present a SAT-based approach for solving the modal logic S5-satisfiability problem. That problem being NP-complete, the translation into SAT is not a surprise. Our contribution is to greatly reduce the number of propositional variables and clauses
Thomas Caridroit +4 more
semanticscholar +1 more source
Spanning trees in random satisfiability problems [PDF]
Journal of Physics A: Mathematical and General, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the associated factor graph.
RAMEZANPOUR, ABOLFAZL, S. MOGHIMI ARAGHI
openaire +3 more sources
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
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS [PDF]
Journal of Universal Computer Science, 2023 Restricted preemption plays a crucial role in reducing total completion time while controlling preemption overhead. A typical version of restricted preemptive models is k-restricted preemptive scheduling, where preemption is only allowed after a task has
Xiaojuan Liao +4 more
doaj +3 more sources
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment [PDF]
, 2017 Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms.
Voigt, Marco
core +3 more sources
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