Results 21 to 30 of about 3,671,128 (304)
Realization of c-Inference as a SAT Problem
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2022 Semantically based on Spohn’s ranking functions, c-representations are special ranking models obtained by assigning individual integer impacts to the conditionals in a knowledge base R and by defining the rank of each possible world as the sum of the ...
Christoph Beierle +2 more
doaj +1 more source
Local Consistency and SAT-Solvers [PDF]
Journal of Artificial Intelligence Research, 2010 Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the ...
Petke, J, Jeavons, P
openaire +5 more sources
A Verified Implementation of the DPLL Algorithm in Dafny
Mathematics, 2022 We present a DPLL SAT solver, which we call TrueSAT, developed in the verification-enabled programming language Dafny. We have fully verified the functional correctness of our solver by constructing machine-checked proofs of its soundness, completeness ...
Cezar-Constantin Andrici +1 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
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Theoretical Computer Science, 2010 Filip Marić
semanticscholar +3 more sources
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
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