Results 251 to 260 of about 3,379,264 (310)
Some of the next articles are maybe not open access.
An Adaptive Parallel SAT Solver
International Conference on Principles and Practice of Constraint Programming, 2016We present and evaluate AmPharoS, a new parallel SAT solver based on the divide and conquer paradigm. This solver, designed to work on a great number of cores, runs workers on sub-formulas restricted to cubes. In addition to classical clause sharing, it also exchange extra information associated to the cubes.
Gilles Audemard +3 more
semanticscholar +2 more sources
c-sat: A Parallel SAT Solver for Clusters
International Conference on Theory and Applications of Satisfiability Testing, 2009Parallelizing modern SAT solvers for clusters such as Beowulf is an important challenge both in terms of performance scalability and stability. This paper describes a SAT Solver c-sat, a parallelization of MiniSat using MPI. It employs a layered master-worker architecture, where the masters handle lemma exchange, deletion of redundant lemmas and the ...
K. Ohmura, K. Ueda
semanticscholar +2 more sources
Zchaff2004: An Efficient SAT Solver
International Conference on Theory and Applications of Satisfiability Testing, 2004The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the ...
Yogesh S. Mahajan, Z. Fu, S. Malik
semanticscholar +2 more sources
A Circuit-Based SAT Solver for Logic Synthesis
2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), 2021In recent years SAT solving has been widely used to implement various circuit transformations in logic synthesis. However, off-the-shelf CNF-based SAT solvers often have suboptimal performance on these challenging optimization problems.
He-Teng Zhang, J. Jiang, A. Mishchenko
semanticscholar +1 more source
Deep Integration of Circuit Simulator and SAT Solver
Design Automation Conference, 2021The paper addresses a key aspect of efficient computation in logic synthesis and formal verification, namely, the integration of a circuit simulator and a Boolean satisfiability solver.
He-Teng Zhang +4 more
semanticscholar +1 more source
SAT-Hard: A Learning-Based Hardware SAT-Solver
2019 22nd Euromicro Conference on Digital System Design (DSD), 2019Within the last decades, tremendous research work has been carried out on the development of software-based algorithms to solve the Boolean Satisfiability Problem. These SAT-solvers have then been heavily orchestrated for addressing complex computational tasks like the verification of circuits. In this field, most of the applied techniques focused only
Ustaoglu, Buse +4 more
openaire +2 more sources
IEICE Proceeding Series, 2014
†Flucto-order Functions Research Team, RIKEN Advanced Science Institute,‡Tokyo Tech-RIKEN International School, Tokyo Institute of Technology,2-1, Hirosawa, Wako, Saitama 351-0198, Japan£Photonic Network Research Institute, National Institute of Information and Communications Technology,4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan§Graduate School ...
Masashi Aono +6 more
openaire +1 more source
†Flucto-order Functions Research Team, RIKEN Advanced Science Institute,‡Tokyo Tech-RIKEN International School, Tokyo Institute of Technology,2-1, Hirosawa, Wako, Saitama 351-0198, Japan£Photonic Network Research Institute, National Institute of Information and Communications Technology,4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan§Graduate School ...
Masashi Aono +6 more
openaire +1 more source
Coherent SAT solvers: a tutorial
Advances in Optics and Photonics, 2023The coherent Ising machine (CIM) is designed to solve the NP-hard Ising problem quickly and energy efficiently. Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are classes of NP-complete and NP-hard problems that are equally important and more practically relevant combinatorial optimization problems.
Sam Reifenstein +8 more
openaire +1 more source
2006 Canadian Conference on Electrical and Computer Engineering, 2006
The Boolean satisfiability problem (SAT) is a central problem in artificial intelligence, mathematical logic and computing theory with wide range of practical applications. Being an NP-complete problem, the used SAT's solving algorithm execution time influences the performance of SAT-based applications.
Mona Safar, M. El-kharashi, Ashraf Salem
openaire +1 more source
The Boolean satisfiability problem (SAT) is a central problem in artificial intelligence, mathematical logic and computing theory with wide range of practical applications. Being an NP-complete problem, the used SAT's solving algorithm execution time influences the performance of SAT-based applications.
Mona Safar, M. El-kharashi, Ashraf Salem
openaire +1 more source
Amoeba-Inspired Stochastic Hardware SAT Solver
IEEE International Symposium on Quality Electronic Design, 2019Since the end of Dennard scaling is almost approaching, new types of computing methods and architectures are being sought. As one of such architectures, hardware solvers for satisfiability (SAT) problems are getting more attentions these days because ...
Kazuaki Hara +3 more
semanticscholar +1 more source