Results 11 to 20 of about 246,520 (298)
Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance [PDF]
PeerJ Computer ScienceAs the core engine of electronic design automation (EDA) tools, the efficiency of Boolean Satisfiability Problem (SAT) solver largely determines the cycle of integrated circuit research and development.
Siyu Yun, Xinsheng Wang
doaj +3 more sources
Discovering heuristics in a complex SAT solver with large language models [PDF]
Nature CommunicationsThe Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world settings is quite challenging due to their intricate architectures.
Yiwen Sun +4 more
doaj +2 more sources
Minimal reduct for propositional circumscription [PDF]
Frontiers in Artificial IntelligenceCircumscription is an important logic framework for representing and reasoning common-sense knowledge. With efficient implementations for circumscription, including circ2dlp and aspino, it has been widely used in model-based diagnosis and other domains ...
Zhongtao Xie +3 more
doaj +2 more sources
Introducing Intel(R) SAT Solver [PDF]
, 2022 We introduce Intel(R) SAT Solver (IntelSAT) - a new open-source CDCL SAT solver, written from scratch. IntelSAT is optimized for applications which generate many mostly satisfiable incremental SAT queries.
Nadel, Alexander
core +1 more source
Minimizing counterexample with Unit Core Extraction and Incremental SAT [PDF]
, 2005 It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample minimization algorithm.
Qin, Ying +5 more
core +2 more sources
A Fast Counterexample Minimization Approach with Refutation Analysis and Incremental SAT [PDF]
, 2005 It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minimization algorithm compared to all other approaches, but its run time overhead ...
Qin, Ying, Li, SiKun, Shen, ShengYu
core +2 more sources
SatHYS: Sat Hybrid Solver [PDF]
, 2013 Proceedings of SAT Race 2010: Solver and Benchmarks DescriptionsThis note describes features of the version of SATHYS that entered the SAT-race 2010 affiliated to the SAT'2010 conference in Edinburgh, Scotland ...
Audemard, Gilles +3 more
core +3 more sources
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 +3 more sources
A pearl on SAT solving in Prolog [PDF]
, 2010 A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented ...
Howe, J. M. +5 more
core +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