A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
- 28 March 2018
- journal article
- research article
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 52 (4) , 2575-2601
Abstract
No abstract availableKeywords
This publication has 84 references indexed in Scilit:
- Local search with edge weighting and configuration checking heuristics for minimum vertex coverArtificial Intelligence, 2011
- An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systemsInternational Journal on Software Tools for Technology Transfer, 2011
- Tarmo: A Framework for Parallelized Bounded Model CheckingElectronic Proceedings in Theoretical Computer Science, 2009
- Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence ConstraintsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- A survey of recent advances in SAT-based formal verificationInternational Journal on Software Tools for Technology Transfer, 2005
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- Boolean satisfiability with transitivity constraintsACM Transactions on Computational Logic, 2002
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960