Skip to content

Benchmark Set for Boolean Constraint Solvers

📖 Description

A set of ASP and SAT benchmarks selected from various competitions. For a full description see Robust Benchmark Set Selection for Boolean Constraint Solvers.

⚙️ Technical Details

  • Type: Decision
  • Format: Smodels, CNF (compressed)
  • Tested With: clingo

📊 Instances

  • Generation: Via selection tool
  • Details: See paper

🔒 Data & Access (Confidentiality)

  • Status: Public
  • Sensitivity: None

🔗 Source & Literature

  • Repository/ZIP:
    TODO (internal: /home/wv/benchmarks/tags/BenchmarkSelectionPaper)
  • Generator URL:
    Selection Tool
  • Reference:
    Hoos, H.H., Kaufmann, B., Schaub, T., Schneider, M. (2013). Robust Benchmark Set Selection for Boolean Constraint Solvers. In: Nicosia, G., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2013. Lecture Notes in Computer Science(), vol 7997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44973-4_16 (pdf)

👤 Contact

💡 Miscellaneous

  • Complexity: NP-hard