Results 1 to 10 of about 42,931 (182)
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 ...
Ekici, Burak +5 more
core +3 more sources
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 +8 more sources
Multi-step partitioning combined with SOM neural network-based clustering technique effectively improves SAT solver performance. [PDF]
PeerJ Comput SciAs 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.
Yun S, Wang X.
europepmc +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
Bertrand Mazure +5 more
core +4 more sources
Minimal reduct for propositional circumscription. [PDF]
Front Artif IntellCircumscription 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 ...
Xie Z, Wang Y, Yang L, Feng R.
europepmc +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
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
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