Results 11 to 20 of about 3,379,264 (310)
AIP Conference Proceedings, 2017 In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design.
Weiwei Gong, Xu Zhou
semanticscholar +2 more sources
Lynx: A Programmatic SAT Solver for the RNA-folding Problem [PDF]
International Conference on Theory and Applications of Satisfiability Testing, 2012 15th International Conference, Trento, Italy, June 17-20, 2012. ProceedingsThis paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to introduce domain-specific code into modern conflict-driven clause-learning (CDCL)
A. Condon +20 more
core +4 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
semanticscholar +4 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
ManySAT: a Parallel SAT Solver
Journal on Satisfiability, Boolean Modeling and Computation, 2009 In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness.
Y. Hamadi, Saïd Jabbour, L. Sais
semanticscholar +3 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 ...
Petke, J, Jeavons, P
openaire +5 more sources