The following pages link to MiniSat (Q13332):
Displaying 50 items.
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- SAT solver management strategies in IC3: an experimental approach (Q526434) (← links)
- Symbolic trajectory evaluation for word-level verification: theory and implementation (Q526779) (← links)
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings (Q532932) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- SampleSearch: importance sampling in presence of determinism (Q543621) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Extended clause learning (Q622116) (← links)
- Explaining the \texttt{cumulative} propagator (Q647477) (← links)
- Latin directed triple systems (Q658105) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Efficient generation of small interpolants in CNF (Q746773) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- Automatic analysis of DMA races using model checking and \(k\)-induction (Q763238) (← links)
- Revised version of block cipher CHAM (Q776328) (← links)
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (Q821554) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- Interpolation and model checking for nonlinear arithmetic (Q832268) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) (Q844184) (← links)
- KBO orientability (Q846165) (← links)
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Non existence of some mixed Moore graphs of diameter 2 using SAT (Q898115) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques (Q941662) (← links)
- Boosting haplotype inference with local search (Q941674) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Functional design errors in digital circuits. Diagnosis correction and repair (Q951243) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
