Results 141 to 150 of about 42,931 (182)

Coherent SAT solvers: a tutorial

Advances in Optics and Photonics, 2023
The 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, Timothee Leleu, Timothy McKenna, Marc Jankowski, Myoung-Gyun Suh, Edwin Ng, Farad Khoyratee, Zoltan Toroczkai, Yoshihisa Yamamoto   +8 more
openaire   +1 more source

FPGA-Based SAT Solver

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

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.
B. Browning, A. Remshagen
openaire   +1 more source

An Extensible SAT-solver

2004
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff. We aim to give sufficient details about implementation to enable the reader to construct his or her own solver in a very short time.This will allow users of SAT-solvers to make domain specific extensions or ...
Niklas Eén, Niklas Sörensson
openaire   +1 more source

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators

Proceedings of the AAAI Conference on Artificial Intelligence, 2016
Special-purpose propagators speed up solving logic programs by inferring facts that are hard to deduce otherwise. However, implementing special-purpose propagators is a non-trivial task and requires expert knowledge of solvers. This paper proposes a novel approach in logic programming that allows (1) logical specification of both the ...
Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska   +2 more
openaire   +4 more sources

Exact DFA Identification Using SAT Solvers

2010
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach is competitive with alternative techniques. Our contributions are fourfold: First, we propose a compact translation of DFA identification into SAT ...
Heule, M.J.H., Verwer, S.E.
openaire   +1 more source

Parallel SAT Solver Selection and Scheduling

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., Sabharwal A., Samulowitz H., Sellmann M.   +3 more
openaire   +1 more source

Propositional Logic: SAT Solvers

2012
Although it is believed that there is no efficient algorithm for the decidability of satisfiability in propositional logic, many algorithms are efficient in practice. This is particularly true when a formula is satisfiable; for example, when you build a truth table for an unsatisfiable formula of size n you will have to generate all 2 n rows, but if ...
openaire   +1 more source

c-sat: A Parallel SAT Solver for Clusters

2009
Parallelizing 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 ...
Kei Ohmura, Kazunori Ueda
openaire   +1 more source

LMHS: A SAT-IP Hybrid MaxSAT Solver

2016
We describe LMHS, an open-source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers.
Berg Jeremias, Järvisalo Matti, Saikko Paul   +2 more
openaire   +1 more source