Controlling a solver execution with the runsolver Tool

MaRDI QIDQ2786915zbMATH OpenFDO

Authors Olivier Roussel

Publication date 23 February 2016

Published in Journal of Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

zbMATH Keywords

competitionsresources limitationsolver control

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 5139165
• Promoting robust black-box solvers through competitions
• ITC2007 solver description: a hybrid approach
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Theory and Applications of Satisfiability Testing

Cited in

(13)

• Evaluation of argument strength in attack graphs: foundations and semantics
• Runsolver
• Certified DQBF solving by definition extraction
• Definability for model counting
• Exact hypervolume subset selection through incremental computations
• SpyBug: automated bug detection in the configuration space of SAT solvers
• New local search methods for partial MaxSAT
• The configurable SAT solver challenge (CSSC)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• The 11th IJCAR automated theorem proving system competition – CASC-J11
• IASCAR: incremental answer set counting by anytime refinement
• Revisiting satzilla features in 2024
• \textsc{Athanor}: local search over abstract constraint specifications

This page was built for publication: Controlling a solver execution with the runsolver Tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786915)