CSPLib: Twenty Years On

09/30/2019
by   Ian Gent, et al.
15

In 1999, we introduced CSPLib, a benchmark library for the constraints community. Our CP-1999 poster paper about CSPLib discussed the advantages and disadvantages of building such a library. Unlike some other domains such as theorem proving, or machine learning, representation was then and remains today a major issue in the success or failure to solve problems. Benchmarks in CSPLib are therefore specified in natural language as this allows users to find good representations for themselves. The community responded positively and CSPLib has become a valuable resource but, as we discuss here, we cannot rest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2023

ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics

We introduce ProofNet, a benchmark for autoformalization and formal prov...
research
08/20/2013

Pylearn2: a machine learning research library

Pylearn2 is a machine learning research library. This does not just mean...
research
07/11/2018

Testing Global Constraints

Every Constraint Programming (CP) solver exposes a library of constraint...
research
09/07/2021

Datasets: A Community Library for Natural Language Processing

The scale, variety, and quantity of publicly-available NLP datasets has ...
research
09/15/2021

Toward Modern Fortran Tooling and a Thriving Developer Community

Fortran is the oldest high-level programming language that remains in us...
research
02/11/2022

REST: Integrating Term Rewriting with Program Verification (Extended Version)

We introduce REST, a novel term rewriting technique for theorem proving ...

Please sign up or login with your details

Forgot password? Click here to reset