Results 41 to 50 of about 42,931 (182)
Exploiting Resolution-based Representations for MaxSAT Solving
, 2015 Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas.
A Gelder Van +16 more
core +1 more source
Proteus: A Hierarchical Portfolio of Solvers and Transformations
, 2014 In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving
B.A. Huberman +11 more
core +1 more source
Lynx: A Programmatic SAT Solver for the RNA-folding Problem [PDF]
, 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 +3 more sources
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Scientific Reports, 2022 Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their ...
Hiroki Oshiyama, Masayuki Ohzeki
doaj +1 more source
On Computing Minimum Unsatisfiable Cores [PDF]
, 2003 Certifying the correctness of a SAT solver is straightforward for satisfiable instances of SAT. Given
Lynce, I., Marques-Silva, J. P.
core +2 more sources
Automated Benchmarking of Incremental SAT and QBF Solvers
, 2015 Incremental SAT and QBF solving potentially yields improvements when sequences of related formulas are solved. An incremental application is usually tailored towards some specific solver and decomposes a problem into incremental solver calls.
A Biere +8 more
core +1 more source
Boosting local search thanks to {CDCL} [PDF]
, 2010 International audienceIn this paper, a novel hybrid and complete approach for propositional satisfiability, called SAT HYS (Sat Hybrid Solver), is introduced.
A. Balint +15 more
core +2 more sources
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
Ural Mathematical Journal, 2018 We approach the problem of computing a D2-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver.
Hanan Shabana
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source
Using a SAT solver to generate checking sequences [PDF]
, 2009 Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence from a given FSM which is an input sequence that determines whether an ...
Jourdan, Guy-Vincent +4 more
core +1 more source