Results 291 to 300 of about 3,677,634 (349)
Some of the next articles are maybe not open access.

An Adaptive Parallel SAT Solver

International Conference on Principles and Practice of Constraint Programming, 2016
We 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
openaire   +2 more sources

Optimizing a Verified SAT Solver

NASA Formal Methods, 2019
In previous work, I verified a SAT solver with dedicated imperative data structures, including the two-watched-literal scheme. In this paper, I extend this formalization with four additional optimizations. The approach is still based on refining an abstract calculus to a deterministic program.
M. Fleury
openaire   +4 more sources

Zchaff2004: An Efficient SAT Solver

International Conference on Theory and Applications of Satisfiability Testing, 2005
The 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   +2 more
openaire   +2 more sources

Parallel SAT Solver Selection and Scheduling

International Conference on Principles and Practice of Constraint Programming, 2012
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition.
Malitsky Y.   +3 more
openaire   +2 more sources

A Circuit-Based SAT Solver for Logic Synthesis

2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), 2021
In 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, 2021
The 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

Accelerating a continuous-time analog SAT solver using GPUs

Computer Physics Communications, 2020
Recently, a continuous-time, deterministic analog solver based on ordinary differential equations (CTDS) was introduced, to solve Boolean satisfiability (SAT), a family of discrete constraint satisfaction problems.
F. Molnár   +3 more
semanticscholar   +1 more source

A SAT-based solver for Q-ALL SAT

Proceedings of the 44th annual Southeast regional conference, 2006
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand to solve even more complex problems residing at the second or higher levels of the polynomial hierarchy.
Ben Browning, Anja Remshagen
openaire   +1 more source

A reconfigurable, pipelined, conflict directed jumping search SAT solver

Design, Automation and Test in Europe, 2011
Mona Safar   +2 more
exaly   +2 more sources

Amoeba-Inspired Stochastic Hardware SAT Solver

IEEE International Symposium on Quality Electronic Design, 2019
Since 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

Home - About - Disclaimer - Privacy