Results 251 to 260 of about 246,520 (298)
Some of the next articles are maybe not open access.
SAT-to-SAT: Declarative Extension of SAT Solvers With New Propagators
Proceedings of the AAAI Conference on Artificial Intelligence, 2016Special-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 +2 more
exaly +2 more sources
Zchaff2004: An Efficient SAT Solver [PDF]
, 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 +3 more sources
A SAT-based solver for Q-ALL SAT
Proceedings of the 44th annual Southeast regional conference, 2006Although 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 +2 more sources
c-sat: A Parallel SAT Solver for Clusters
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 ...
Kei Ohmura, Kazunori Ueda
openaire +2 more sources
Integrating Algebraic and SAT Solvers
2017For 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.
Jan Horácek +3 more
openaire +3 more sources
A Preprocessor for Max-SAT Solvers
2008We describe a preprocessor that incorporates a variable saturation procedure for Max-SAT, and provide empirical evidence that it improves the performance of some of the most successful state-of-the-art solvers on several partial (weighted) Max-SAT instances of the 2007 Max-SAT Evaluation.
Josep Argelich +2 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 +2 more
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 +2 more
openaire +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
Buse Ustaoglu +4 more
openaire +2 more sources
Applications of #SAT Solvers on Feature Models
Proceedings of the 15th International Working Conference on Variability Modelling of Software-Intensive Systems, 2021Product lines are ubiquitous for managing variable systems. The variability of a product line is typically described in terms of a feature model. Analyzing a feature model gives insight into various aspects, such as the validity of a configuration of features.
Chico Sundermann +5 more
openaire +2 more sources
An Adaptive Parallel SAT Solver
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
openaire +2 more sources