MedleySolver: online SMT algorithm selection
From MaRDI portal
Publication:2118336
DOI10.1007/978-3-030-80223-3_31OpenAlexW3185149219MaRDI QIDQ2118336
Nikhil Pimpalkhare, Federico Mora, Elizabeth Polgreen, Sanjit A. Seshia
Publication date: 22 March 2022
Full work available at URL: http://hdl.handle.net/20.500.11820/b2ea7a05-d9f4-4ac4-a70e-108c8f323522
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (3)
MedleySolver ⋮ Machine learning and logic: a new frontier in artificial intelligence ⋮ Bayesian ranking for strategy scheduling in automated theorem provers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision procedures. An algorithmic point of view
- Learning and updating of uncertainty in Dirichlet models
- Tutorial on maximum likelihood estimation
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- The Nonstochastic Multiarmed Bandit Problem
- Coming to terms with quantified reasoning
- Prediction, Learning, and Games
- Deciding Bit-Vector Arithmetic with Abstraction
This page was built for publication: MedleySolver: online SMT algorithm selection