Results 1 to 10 of about 3,379,264 (310)
The Configurable SAT Solver Challenge (CSSC) [PDF]
Artificial Intelligence, 2016 It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be ...
Balint, Adrian +5 more
core +10 more sources
Generating Extended Resolution Proofs with a BDD-Based SAT Solver [PDF]
Tools and Algorithms for the Construction and Analysis of Systems27th International Conference, 2021 In 2006, Biere, Jussila, and Sinz made the key observation that the underlying logic behind algorithms for constructing Reduced, Ordered Binary Decision Diagrams (BDDs) can be encoded as steps in a proof in the extended resolution logical framework ...
Bryant R, Heule M.
europepmc +3 more sources
A Flexible Proof Format for SAT Solver-Elaborator Communication [PDF]
Logical Methods in Computer Science, 2022 We introduce FRAT, a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to DRAT, the FRAT format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to LRAT.
Seulkee Baek +2 more
doaj +3 more sources
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 +4 more sources
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. [PDF]
J Autom Reason, 2018 We developed a formal framework for conflict-driven clause learning (CDCL) using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL calculus is connected first to a more concrete calculus, then to a SAT solver expressed in
Blanchette JC +3 more
europepmc +2 more sources
Goal-Aware Neural SAT Solver [PDF]
2022 International Joint Conference on Neural Networks (IJCNN), 2021 Modern neural networks obtain information about the problem and calculate the output solely from the input values. We argue that it is not always optimal, and the network's performance can be significantly improved by augmenting it with a query mechanism
Emils Ozolins +5 more
semanticscholar +3 more sources
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
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 +5 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
HordeSat: A Massively Parallel Portfolio SAT Solver
International Conference on Theory and Applications of Satisfiability Testing, 2015 A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution.
Balyo, Tomas +2 more
core +2 more sources