Results 31 to 40 of about 1,116 (265)
AIP Conference Proceedings, 2017 In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design.
Weiwei Gong, Xu Zhou
openaire +1 more source
EPiC Series in Computing, 2018 In this paper we present new implementation details and benchmarking results for our parallel portfolio solver TopoSAT2. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1, 000 solver threads in parallel.
Thorsten Ehlers, Dirk Nowotka
openaire +3 more sources
LearnSAT: A SAT Solver for Education [PDF]
Journal of Open Source Software, 2013 The extensive research on SAT solving and the development of software for applications have not been matched by the development of educational materials for introducing students to this field. LearnSAT is a SAT solver designed for educational purposes. It implements the DPLL algorithm with CDCL and NCB.
openaire +1 more source
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Scientific Reports, 2022 Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their ...
Hiroki Oshiyama, Masayuki Ohzeki
doaj +1 more source
CDCL(Crypto) SAT Solvers for Cryptanalysis
CoRR, 2020 Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-driven clause-learning Boolean satisfiability (CDCL SAT) solvers on industrial problems from a variety of domains. The availability of such powerful general-purpose search tools as SAT solvers has led many researchers to propose SAT-based methods for ...
Saeed Nejati, Vijay Ganesh 0001
openaire +3 more sources
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
ManySAT: a Parallel SAT Solver
Journal on Satisfiability, Boolean Modeling and Computation, 2009 In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential algorithms obtained through careful variations of the standard ...
Youssef Hamadi +2 more
openaire +2 more sources
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
Ural Mathematical Journal, 2018 We approach the problem of computing a D2-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver.
Hanan Shabana
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source