Results 1 to 10 of about 1,116 (265)
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
An Effective SAT Solver Utilizing ACO Based on Heterogenous Systems
IEEE Access, 2020 This paper presents new parallel strategies for preprocessing and solving the issue of Boolean Satisfaction (SAT) on Heterogeneous systems of multicore and many-core CPU and Graphics Processing Unit (GPU) using Open Multi-Processor (OpenMP) and NVIDIA ...
Hassan Youness +2 more
exaly +3 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
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS [PDF]
Journal of Universal Computer Science, 2023 Restricted preemption plays a crucial role in reducing total completion time while controlling preemption overhead. A typical version of restricted preemptive models is k-restricted preemptive scheduling, where preemption is only allowed after a task has
Xiaojuan Liao +4 more
doaj +3 more sources
An Experimental Survey of Extended Resolution Effects for SAT Solvers on the Pigeonhole Principle
Algorithms, 2022 It has been proven that extended resolution (ER) has more powerful reasoning than general resolution for the pigeonhole principle in Cook’s paper.
Tomohiro Sonobe
doaj +1 more source
Verifying the DPLL Algorithm in Dafny [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Modern high-performance SAT solvers quickly solve large satisfiability instances that occur in practice. If the instance is satisfiable, then the SAT solver can provide a witness which can be checked independently in the form of a satisfying truth ...
Cezar-Constantin Andrici +1 more
doaj +1 more source
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 ...
Justyna Petke, Peter Jeavons 0001
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
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 +1 more source