CEGAR-Based Combinatorial Optimization Modulo QLA Benchmarks

Kerian Thuillier of the Centre National de la Recherche Scientifique created this benchmark data for a paper presented at AAAI 2024. The data supports a CEGAR-based approach for solving combinatorial optimization problems modulo quantified linear arithmetics. It includes the technical appendix and code used to generate the benchmarks.

Use Cases

• Benchmarking solver performance based on the described CEGAR-based approach
• Reproducing experimental results from the AAAI 2024 paper based on the provided code and data
• Developing new algorithms for combinatorial optimization modulo theories based on the generated problem instances

Strengths

• Data is directly linked to a peer-reviewed AAAI 2024 publication, providing academic credibility.
• Includes both the generated benchmark data and the code used for its creation, facilitating reproducibility.

Limitations

• Column-level documentation is absent; field semantics must be inferred after download.
• Row count and dataset size are unknown, which may limit suitability assessment.

Provenance

Source

Kerian Thuillier, Centre National de la Recherche Scientifique

Collection Method

Generated for benchmarks in a research paper.