Targeted configuration of an SMT solver
From MaRDI portal
Publication:6160570
Recommendations
- The strategy challenge in SMT solving
- The configurable SAT solver challenge (CSSC)
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- SATenstein: automatically building local search SAT solvers from components
- SpyBug: automated bug detection in the configuration space of SAT solvers
Cites work
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- Concrete semantics. With Isabelle/HOL
- Extending Sledgehammer with SMT solvers
- Hammering towards QED
- Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
- Hierarchical invention of theorem proving strategies
- scientific article; zbMATH DE number 5850143 (Why is no real title available?)
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Paramils: an automatic algorithm configuration framework
- Refutation-based synthesis in SMT
- SATzilla: portfolio-based algorithm selection for SAT
- SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
- Structural analysis of narratives with the Coq proof assistant
- System description: E 1.8
Cited in
(5)
This page was built for publication: Targeted configuration of an SMT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160570)