Combinatorial optimization and reasoning with graph neural networks
Combinatorial optimization is a well-established area in operations research and computer
science. Until recently, its methods have focused on solving problem instances in isolation …
science. Until recently, its methods have focused on solving problem instances in isolation …
Self-healing robust neural networks via closed-loop control
Despite the wide applications of neural networks, there have been increasing concerns
about their vulnerability issue. While numerous attack and defense techniques have been …
about their vulnerability issue. While numerous attack and defense techniques have been …
Managing SAT inconsistencies with HUMUS
In Product Line Engineering, as in any other modeling domain, designers and end users are
prone to making inconsistent assumptions (errors) because of complexity and lack of system …
prone to making inconsistent assumptions (errors) because of complexity and lack of system …
An efficient SAT-based test generation algorithm with GPU accelerator
This paper presents a novel framework comprises of a Propositional Satisfiability (SAT)
encoder and solver. The framework responsible for generating and proving a simplified SAT …
encoder and solver. The framework responsible for generating and proving a simplified SAT …
Towards faster reasoners by using transparent huge pages
Various state-of-the-art automated reasoning (AR) tools are widely used as backend tools in
research of knowledge representation and reasoning as well as in industrial applications. In …
research of knowledge representation and reasoning as well as in industrial applications. In …
Addressing variable dependency in gnn-based SAT solving
Boolean satisfiability problem (SAT) is fundamental to many applications. Existing works
have used graph neural networks (GNNs) for (approximate) SAT solving. Typical GNN …
have used graph neural networks (GNNs) for (approximate) SAT solving. Typical GNN …
Fpga acceleration of enhanced boolean constraint propagation for sat solvers
J Thong, N Nicolici - 2013 IEEE/ACM International Conference …, 2013 - ieeexplore.ieee.org
We propose a hardware architecture to accelerate boolean constraint propagation (BCP).
Although satisfiability (SAT) solvers in software use varying search and learning strategies …
Although satisfiability (SAT) solvers in software use varying search and learning strategies …
Heuristics for Quantum Computing Dealing with 3-SAT
The SAT problem is maybe one of the most famous NP-complete problems. This paper
deals with the 3-SAT problem. We follow a sort of incremental strategy to save computational …
deals with the 3-SAT problem. We follow a sort of incremental strategy to save computational …
A hybrid SAT and lattice reduction approach for integer factorization
Y Ajani - 2024 - search.proquest.com
The difficulty of factoring large integers into primes is the basis for cryptosystems such as
RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on …
RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on …
Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning
Despite the success of practical solvers in various NP-complete domains such as SAT and
CSP as well as using deep reinforcement learning to tackle two-player games such as Go …
CSP as well as using deep reinforcement learning to tackle two-player games such as Go …