Promoting robust black-box solvers through competitions

DOI10.1007/S10601-010-9092-1zbMATH Open1208.68203OpenAlexW2157275554MaRDI QIDQ606901FDOQ606901

Olivier Roussel, M. R. C. van Dongen, Christophe Lecoutre

Publication date: 19 November 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-010-9092-1

Recommendations

• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 5139165
• Philosophy of the MiniZinc challenge
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

zbMATH Keywords

black-boxexperimental evaluationrobust constraint solverssolver competition

Mathematics Subject Classification ID

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

Cites Work

• Partition search for non-binary constraint satisfaction
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Principles and Practice of Constraint Programming – CP 2004
• Compiling Finite Linear CSP into SAT
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recording and minimizing nogoods from restarts

Cited In (1)

• aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

Uses Software

• Choco
• CaSPER
• Sugar
• MINION
• Mistral

This page was built for publication: Promoting robust black-box solvers through competitions

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