MedleySolver: online SMT algorithm selection
From MaRDI portal
Publication:2118336
Recommendations
- On-line algorithms for polynomially solvable satisfiability problems
- The \textsc{MergeSat} solver
- scientific article; zbMATH DE number 437568
- SATzilla: portfolio-based algorithm selection for SAT
- Theory and implementation of online multiselection algorithms
- On-line algorithms for satisfiability problems with uncertainty
- On-line algorithms for satisfiability problems with uncertainty
- SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME
- Online Estimation of SAT Solving Runtime
Cites work
- Coming to terms with quantified reasoning
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Deciding Bit-Vector Arithmetic with Abstraction
- Decision procedures. An algorithmic point of view
- scientific article; zbMATH DE number 1903346 (Why is no real title available?)
- Learning and updating of uncertainty in Dirichlet models
- Prediction, Learning, and Games
- SATzilla: portfolio-based algorithm selection for SAT
- Solving quantified bit-vector formulas using binary decision diagrams
- The Nonstochastic Multiarmed Bandit Problem
- Tutorial on maximum likelihood estimation
Cited in
(4)
This page was built for publication: MedleySolver: online SMT algorithm selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118336)