Results 11 to 20 of about 1,116 (265)
Extending SMTCoq, a Certified Checker for SMT (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 This extended abstract reports on current progress of SMTCoq, a communication tool between the Coq proof assistant and external SAT and SMT solvers. Based on a checker for generic first-order certificates implemented and proved correct in Coq, SMTCoq ...
Burak Ekici +5 more
doaj +1 more source
Boosting the Performance of CDCL-Based SAT Solvers by Exploiting Backbones and Backdoors
Algorithms, 2022 Boolean structural measures were introduced to explain the high performance of conflict-driven clause-learning (CDCL) SAT solvers on industrial SAT instances.
Tasniem Al-Yahya +2 more
doaj +1 more source
Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions [PDF]
International Journal of Electronics and Telecommunications, 2023 In this article we present a procedure that allows to synthesize optimal circuit representing any reversible function within reasonable size limits. The procedure allows to choose either the NCT or the MCT gate set and specify any number of ancillary ...
Adam Jagielski
doaj +1 more source
Branching Heuristic Strategy Based on Learnt Clauses Deletion Strategy for SAT Solver [PDF]
Jisuanji kexue, 2021 For the SAT solver,most popular branch variable decision-making strategies are based on the variable activity evaluation of conflict.The unassigned variable with the maximum activity is selected as the decision variable,and the most recent conflict is ...
WANG Yi-jie, XU Yang, WU Guan-feng
doaj +1 more source
Model Abstraction for Discrete-Event Systems Using a SAT Solver
IEEE Access, 2023 Model abstraction for finite state automata is beneficial to reduce the complexity of discrete-event systems (DES), enhance the readability and facilitate the control synthesis and verification of DES.
Lihong Cheng, Lei Feng
doaj +1 more source
International Journal on Artificial Intelligence Tools, 2018 The set of novelties introduced with the SAT solver Glucose is now considered as a standard for practical SAT solving. In this paper, we review the different strategies and technologies added in Glucose over the years. We detail each technique and discuss its impact on the final performances reached by Glucose.
Audemard, Gilles, Simon, Laurent
openaire +1 more source
Applying aspiration in local search for satisfiability.
PLoS ONE, 2020 The Boolean Satisfiability problem (SAT) is a prototypical NP-complete problem, which has been widely studied due to its significant importance in both theory and applications.
Cong Peng, Zhongwei Xu, Meng Mei
doaj +1 more source
Incremental SAT Library Integration Using Abstract Stobjs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We describe an effort to soundly use off-the-shelf incremental SAT solvers within ACL2 by modeling the behavior of a SAT solver library as an abstract stobj. The interface allows ACL2 programs to use incremental SAT solvers, and the abstract stobj model
Sol Swords
doaj +1 more source
FPGA-Based Hardware/Software Co-Design of a Bio-Inspired SAT Solver
IEEE Access, 2020 For various kinds of Internet of Things (IoT) systems whose control rules can be expressed in a Satisfiability (SAT) problem, this work aims at realizing an IoT-oriented FPGA-based SAT solver leveraging a bio-inspired algorithm, AmoebaSAT, using a ...
Anh Hoang Ngoc Nguyen +2 more
doaj +1 more source
Integrating Conflict Driven Clause Learning to Local Search [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is
Gilles Audenard +3 more
doaj +1 more source