Results 71 to 80 of about 263 (134)
Sampling Techniques for Boolean Satisfiability
CoRR, 2014 Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of counting the total number of satisfying assignments have ...
openaire +3 more sources
Generalizing Boolean Satisfiability III: Implementation
Journal of Artificial Intelligence Research, 2005 This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean ...
Heidi E. Dixon +4 more
openaire +6 more sources
Boolean Abstraction for Temporal Logic Satisfiability [PDF]
, 2007 Increasing interest towards property based design calls for effective satisfiability procedures for expressive temporal logics, e.g. the IEEE standard Property Specification Language (PSL). In this paper, we propose a new approach to the satisfiability of PSL formulae; we follow recent approaches to decision procedures for Satisfiability Modulo ...
Alessandro Cimatti +3 more
openaire +1 more source
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.Financial distress prediction demands models that balance complex pattern recognition with interpretable decision logic. This study reframes the prediction task as a Boolean satisfiability (SAT) problem and introduces a hybrid neurosymbolic framework, Hopfield neural network (HNN)–RANkSATRA, that integrates HNNs with metaheuristic optimization to ...
Hamza Abubakar +3 more
wiley +1 more source
Enhancing Quantum Approximate Optimization Algorithm Through Manifold Optimization
Quantum Engineering, Volume 2026, Issue 1, 2026.We propose the models of Riemannian manifold optimization techniques to enhance the performance of the quantum approximate optimization algorithm (QAOA) for combinatorial optimization problems on near‐term quantum devices. The approach leverages the intrinsic geometric structure of the problem domain, addressing the nonconvexity of the QAOA objective ...
Qingqing Yu +3 more
wiley +1 more source
Accurate Modeling of Continuous-time SAT Solvers in SPICE [PDF]
RadioengineeringRecently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate implementations of two continuous-time dynamical solvers, known in the literature as analog SAT and ...
Y. V. Pershin, D. C. Nguyen
doaj
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +1 more source
Fast counting with tensor networks
SciPost Physics, 2019 We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying ...
Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
doaj +1 more source
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 +2 more sources
SoftwareXThis paper presents Depex, a tool that allows developers to reason over the entire configuration space of the dependencies of an open-source software repository.
Antonio Germán Márquez +4 more
doaj +1 more source