Results 21 to 30 of about 246,520 (298)
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
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
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
Solving Huge Instances with Intel(R) SAT Solver [PDF]
, 2023 We introduce a new release of our SAT solver Intelregistered SAT Solver. The new release, called IS23, is targeted to solve huge instances beyond the capacity of other solvers.
Nadel, Alexander
core +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
The Uses of SAT Solvers in Vampire
EPiC Series in Computing, 2018 Reasoning in a saturation-based first-order theorem prover is generally expensive involving complex term-indexing data structures and inferences such as subsumption resolution whose (worst case) running time is exponential in the length of the clause.
Giles Reger, Martin Suda 0001
openaire +2 more sources
The International SAT Solver Competitions [PDF]
AI Magazine, 2012 The International SAT Solver Competition is today an established series of competitive events aiming at objectively evaluating the progress in state‐of‐the‐art procedures for solving Boolean satisfiability (SAT) instances. Over the years, the competitions have significantly contributed to the fast progress in SAT solver technology that has made SAT a ...
Matti Järvisalo +3 more
openaire +3 more sources
Further accelerating the search of differential characteristics based on the SAT method
网络与信息安全学报, 2022 Sun et al.’s method of using Matsui’s bounding conditions to accelerate the search of differential characteristics was reviewed.Matsui’s boundary conditions and Sun et al.’s method of using Matsui’s bounding conditions to accelerate the search of ...
Zheng XU
doaj +3 more sources
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +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