Targeted configuration of an SMT solver

DOI10.1007/978-3-031-16681-5_18MaRDI QIDQ6160570

Lukáš Kubej, Mikoláš Janota, Jan Jakubův, Jan Hůla

Publication date: 2 June 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

machine learningstrategy schedulingsatisfiability module theoriesstrategy invention

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68Vxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
• Refutation-based synthesis in SMT
• Extending Sledgehammer with SMT solvers
• $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
• System Description: E 1.8
• Concrete Semantics
• Structural Analysis of Narratives with the Coq Proof Assistant
• ParamILS: An Automatic Algorithm Configuration Framework
• Hierarchical invention of theorem proving strategies
• Hammering towards QED

This page was built for publication: Targeted configuration of an SMT solver