Results 31 to 40 of about 770 (181)
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
Multipath Detection Using Boolean Satisfiability Techniques
Journal of Computer Networks and Communications, 2011 A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT) techniques to search through the uncertainty region of the multipath
Fadi A. Aloul, Mohamed El-Tarhuni
doaj +1 more source
Model checking with Boolean Satisfiability [PDF]
Journal of Algorithms, 2008 The evolution of SAT algorithms over the last decade has motivated the application of SAT to model checking, initially through the use of SAT in bounded model checking and, more recently, in unbounded model checking. This paper provides an overview of modern SAT algorithms, SAT-based bounded model checking and some of the most promising approaches for ...
openaire +1 more source
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability [PDF]
Logical Methods in Computer Science, 2012 The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification.
Tino Teige, Martin Fränzle
doaj +1 more source
Boolean satisfiability in electronic design automation [PDF]
Proceedings of the 37th conference on Design automation - DAC '00, 2000 Boolean Satisfiability (SAT) is often used as the underlying model for a significant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other fields of Computer Science and Engineering. In recent years, new and efficient algorithms for SAT have been developed, allowing much larger problem instances to be ...
Marques-Silva, J. P., Sakallah, K. A.
openaire +1 more source
Satisfiability-Based Algorithms for Boolean Optimization [PDF]
Annals of Mathematics and Artificial Intelligence, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manquinho, V., Marques-Silva, J. P.
openaire +1 more source
Axioms, 2023 This work proposed a new hybridised network of 3-Satisfiability structures that widens the search space and improves the effectiveness of the Hopfield network by utilising fuzzy logic and a metaheuristic algorithm.
Farah Liyana Azizan +4 more
doaj +1 more source
Connectivity of Boolean Satisfiability
CoRR, 2015 For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. For this implicitly defined graph, we here study the st-connectivity and connectivity problems. Building on the work of Gopalan et
openaire +2 more sources
Extending Boolean Methods for Scalable Logic Synthesis
IEEE Access, 2020 In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results.
Eleonora Testa +6 more
doaj +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source