Automated Benchmarking of Incremental SAT and QBF Solvers

DOI10.1007/978-3-662-48899-7_13zbMath1471.68306arXiv1506.08563OpenAlexW3099535388MaRDI QIDQ3460052

Uwe Egly, Johannes Oetsch, Florian Lonsing

Publication date: 12 January 2016

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08563

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

SAT race 2015

This page was built for publication: Automated Benchmarking of Incremental SAT and QBF Solvers