Results 261 to 270 of about 3,671,128 (304)

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

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

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

30.3 VIP-Sat: A Boolean Satisfiability Solver Featuring 5×12 Variable In-Memory Processing Elements with 98% Solvability for 50-Variables 218-Clauses 3-SAT Problems

IEEE International Solid-State Circuits Conference
Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic design automation, and VLSI tests with practical examples, such
Chaeyun Shim, Jooyoung Bae, Bongjin Kim
semanticscholar   +1 more source

Planning with Specialized SAT Solvers

Proceedings of the AAAI Conference on Artificial Intelligence, 2011
Logic, and declarative representation of knowledge in general, have long been a preferred framework for problem solving in AI. However, specific subareas of AI have been eager to abandon general-purpose knowledge representation in favor of methods that seem to address their computational core problems better.
openaire   +1 more source

Integrating Algebraic and SAT Solvers

2017
For solving systems of Boolean polynomials whose zeros are known to be contained in \(\mathbb {F}_2^n\), algebraic solvers such as the Boolean Border Basis Algorithm (BBBA) and SAT solvers use very different and possibly complementary methods to create new information.
Horáček, Jan, Burchard, Jan, Becker, Bernd, Kreuzer, Martin   +3 more
openaire   +2 more sources

Chaff: engineering an efficient SAT solver

Proceedings - Design Automation Conference, 2001
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, S. Malik   +4 more
semanticscholar   +1 more source