DCP-Bench-Open Article Swipe
Michailidis, Kostis
,
Tsouros, Dimosthenis
,
Guns, Tias
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.5281/zenodo.17800138
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.5281/zenodo.17800138
Here is the GitHub repository: https://github.com/DCP-Bench/DCP-Bench-OpenDCP-Bench-Open is a collaborative benchmark of Discrete Combinatorial Problems, with only involving integer and Boolean decision variables. Many problem formulations come from the Constraint Programming (CP) community, as well as the Integer Programming community (no continuous variables), Pseudo-Boolean and Satisfiability communities.This benchmark has two primary goals:1. **To provide a centralized repository** of discrete combinatorial optimisation and satisfaction problems, including clear natural language descriptions, corresponding data instances and ground-truth constraint models.2. **To serve as an evaluation framework** for evaluating generative AI systems (e.g. LLMs) in their ability to generate executable constraint models from natural language descriptions.In the repository, the ground-truth models are (currently) using the CPMpy library. The evaluation framework can (currently) evaluate generated models in CPMpy, MiniZinc or Or-Tools CP-SAT and more can be added with limited effort.This benchmark is an open source project that welcomes additional problems, data instances and evaluation tooling from interested developers. For reproducability, always use a specific 'Release' in your research (see below). This project started as an extension of the original CP-Bench (https://huggingface.co/datasets/kostis-init/CP-Bench) published at ECAI 2025.
Related Topics
Concepts
Constraint programming
Executable
Benchmark (surveying)
Computer science
Constraint satisfaction problem
Constraint satisfaction
Integer programming
Constraint (computer-aided design)
Constraint logic programming
Extension (predicate logic)
Programming language
Theoretical computer science
Integer (computer science)
Backtracking
Satisfiability
Artificial intelligence
Feature (linguistics)
Boolean satisfiability problem
Linear programming
Modeling language
Mathematical optimization
Lexicographical order
Combinatorial optimization
Semantics (computer science)
Logic programming
Concurrent constraint logic programming
Metadata
- Type
- dataset
- Landing Page
- https://doi.org/10.5281/zenodo.17800138
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W7110919875
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7110919875Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.5281/zenodo.17800138Digital Object Identifier
- Title
-
DCP-Bench-OpenWork title
- Type
-
datasetOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-12-03Full publication date if available
- Authors
-
Michailidis, Kostis, Tsouros, Dimosthenis, Guns, TiasList of authors in order
- Landing page
-
https://doi.org/10.5281/zenodo.17800138Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.5281/zenodo.17800138Direct OA link when available
- Concepts
-
Constraint programming, Executable, Benchmark (surveying), Computer science, Constraint satisfaction problem, Constraint satisfaction, Integer programming, Constraint (computer-aided design), Constraint logic programming, Extension (predicate logic), Programming language, Theoretical computer science, Integer (computer science), Backtracking, Satisfiability, Artificial intelligence, Feature (linguistics), Boolean satisfiability problem, Linear programming, Modeling language, Mathematical optimization, Lexicographical order, Combinatorial optimization, Semantics (computer science), Logic programming, Concurrent constraint logic programmingTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7110919875 |
|---|---|
| doi | https://doi.org/10.5281/zenodo.17800138 |
| ids.doi | https://doi.org/10.5281/zenodo.17800138 |
| ids.openalex | https://openalex.org/W7110919875 |
| fwci | |
| type | dataset |
| title | DCP-Bench-Open |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C173404611 |
| concepts[0].level | 3 |
| concepts[0].score | 0.7051170468330383 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q528588 |
| concepts[0].display_name | Constraint programming |
| concepts[1].id | https://openalex.org/C160145156 |
| concepts[1].level | 2 |
| concepts[1].score | 0.699509859085083 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q778586 |
| concepts[1].display_name | Executable |
| concepts[2].id | https://openalex.org/C185798385 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6642207503318787 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[2].display_name | Benchmark (surveying) |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.6029642224311829 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C199622910 |
| concepts[4].level | 3 |
| concepts[4].score | 0.5816999077796936 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1128326 |
| concepts[4].display_name | Constraint satisfaction problem |
| concepts[5].id | https://openalex.org/C44616089 |
| concepts[5].level | 3 |
| concepts[5].score | 0.5606844425201416 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q30158686 |
| concepts[5].display_name | Constraint satisfaction |
| concepts[6].id | https://openalex.org/C56086750 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5477541089057922 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q6042592 |
| concepts[6].display_name | Integer programming |
| concepts[7].id | https://openalex.org/C2776036281 |
| concepts[7].level | 2 |
| concepts[7].score | 0.5229145288467407 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q48769818 |
| concepts[7].display_name | Constraint (computer-aided design) |
| concepts[8].id | https://openalex.org/C176783269 |
| concepts[8].level | 4 |
| concepts[8].score | 0.5228815078735352 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q5164378 |
| concepts[8].display_name | Constraint logic programming |
| concepts[9].id | https://openalex.org/C2778029271 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4520435333251953 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5421931 |
| concepts[9].display_name | Extension (predicate logic) |
| concepts[10].id | https://openalex.org/C199360897 |
| concepts[10].level | 1 |
| concepts[10].score | 0.44408440589904785 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[10].display_name | Programming language |
| concepts[11].id | https://openalex.org/C80444323 |
| concepts[11].level | 1 |
| concepts[11].score | 0.425716370344162 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[11].display_name | Theoretical computer science |
| concepts[12].id | https://openalex.org/C97137487 |
| concepts[12].level | 2 |
| concepts[12].score | 0.42263954877853394 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q729138 |
| concepts[12].display_name | Integer (computer science) |
| concepts[13].id | https://openalex.org/C156884757 |
| concepts[13].level | 2 |
| concepts[13].score | 0.3823794722557068 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q798554 |
| concepts[13].display_name | Backtracking |
| concepts[14].id | https://openalex.org/C168773769 |
| concepts[14].level | 2 |
| concepts[14].score | 0.3599732518196106 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1350299 |
| concepts[14].display_name | Satisfiability |
| concepts[15].id | https://openalex.org/C154945302 |
| concepts[15].level | 1 |
| concepts[15].score | 0.35342544317245483 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[15].display_name | Artificial intelligence |
| concepts[16].id | https://openalex.org/C2776401178 |
| concepts[16].level | 2 |
| concepts[16].score | 0.3506070673465729 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q12050496 |
| concepts[16].display_name | Feature (linguistics) |
| concepts[17].id | https://openalex.org/C6943359 |
| concepts[17].level | 2 |
| concepts[17].score | 0.33300161361694336 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q875276 |
| concepts[17].display_name | Boolean satisfiability problem |
| concepts[18].id | https://openalex.org/C41045048 |
| concepts[18].level | 2 |
| concepts[18].score | 0.32551804184913635 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q202843 |
| concepts[18].display_name | Linear programming |
| concepts[19].id | https://openalex.org/C179603123 |
| concepts[19].level | 3 |
| concepts[19].score | 0.2931436002254486 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q1941921 |
| concepts[19].display_name | Modeling language |
| concepts[20].id | https://openalex.org/C126255220 |
| concepts[20].level | 1 |
| concepts[20].score | 0.29049041867256165 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[20].display_name | Mathematical optimization |
| concepts[21].id | https://openalex.org/C159254197 |
| concepts[21].level | 2 |
| concepts[21].score | 0.2838217318058014 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q1144915 |
| concepts[21].display_name | Lexicographical order |
| concepts[22].id | https://openalex.org/C52692508 |
| concepts[22].level | 2 |
| concepts[22].score | 0.27653101086616516 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q1333872 |
| concepts[22].display_name | Combinatorial optimization |
| concepts[23].id | https://openalex.org/C184337299 |
| concepts[23].level | 2 |
| concepts[23].score | 0.2744290232658386 |
| concepts[23].wikidata | https://www.wikidata.org/wiki/Q1437428 |
| concepts[23].display_name | Semantics (computer science) |
| concepts[24].id | https://openalex.org/C128838566 |
| concepts[24].level | 2 |
| concepts[24].score | 0.26009753346443176 |
| concepts[24].wikidata | https://www.wikidata.org/wiki/Q275603 |
| concepts[24].display_name | Logic programming |
| concepts[25].id | https://openalex.org/C204306468 |
| concepts[25].level | 5 |
| concepts[25].score | 0.2519543468952179 |
| concepts[25].wikidata | https://www.wikidata.org/wiki/Q5159106 |
| concepts[25].display_name | Concurrent constraint logic programming |
| keywords[0].id | https://openalex.org/keywords/constraint-programming |
| keywords[0].score | 0.7051170468330383 |
| keywords[0].display_name | Constraint programming |
| keywords[1].id | https://openalex.org/keywords/executable |
| keywords[1].score | 0.699509859085083 |
| keywords[1].display_name | Executable |
| keywords[2].id | https://openalex.org/keywords/benchmark |
| keywords[2].score | 0.6642207503318787 |
| keywords[2].display_name | Benchmark (surveying) |
| keywords[3].id | https://openalex.org/keywords/constraint-satisfaction-problem |
| keywords[3].score | 0.5816999077796936 |
| keywords[3].display_name | Constraint satisfaction problem |
| keywords[4].id | https://openalex.org/keywords/constraint-satisfaction |
| keywords[4].score | 0.5606844425201416 |
| keywords[4].display_name | Constraint satisfaction |
| keywords[5].id | https://openalex.org/keywords/integer-programming |
| keywords[5].score | 0.5477541089057922 |
| keywords[5].display_name | Integer programming |
| keywords[6].id | https://openalex.org/keywords/constraint |
| keywords[6].score | 0.5229145288467407 |
| keywords[6].display_name | Constraint (computer-aided design) |
| keywords[7].id | https://openalex.org/keywords/constraint-logic-programming |
| keywords[7].score | 0.5228815078735352 |
| keywords[7].display_name | Constraint logic programming |
| keywords[8].id | https://openalex.org/keywords/extension |
| keywords[8].score | 0.4520435333251953 |
| keywords[8].display_name | Extension (predicate logic) |
| language | |
| locations[0].id | doi:10.5281/zenodo.17800138 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400562 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Zenodo (CERN European Organization for Nuclear Research) |
| locations[0].source.host_organization | https://openalex.org/I67311998 |
| locations[0].source.host_organization_name | European Organization for Nuclear Research |
| locations[0].source.host_organization_lineage | https://openalex.org/I67311998 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | |
| locations[0].raw_type | dataset |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.5281/zenodo.17800138 |
| indexed_in | datacite |
| authorships[0].author.id | |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Michailidis, Kostis |
| authorships[0].countries | BE |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I99464096 |
| authorships[0].affiliations[0].raw_affiliation_string | KU Leuven |
| authorships[0].institutions[0].id | https://openalex.org/I99464096 |
| authorships[0].institutions[0].ror | https://ror.org/05f950310 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I99464096 |
| authorships[0].institutions[0].country_code | BE |
| authorships[0].institutions[0].display_name | KU Leuven |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Michailidis, Kostis |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | KU Leuven |
| authorships[1].author.id | |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Tsouros, Dimosthenis |
| authorships[1].countries | BE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I99464096 |
| authorships[1].affiliations[0].raw_affiliation_string | KU Leuven |
| authorships[1].institutions[0].id | https://openalex.org/I99464096 |
| authorships[1].institutions[0].ror | https://ror.org/05f950310 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I99464096 |
| authorships[1].institutions[0].country_code | BE |
| authorships[1].institutions[0].display_name | KU Leuven |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Tsouros, Dimosthenis |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | KU Leuven |
| authorships[2].author.id | https://openalex.org/A2753325917 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Guns, Tias |
| authorships[2].countries | BE |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I99464096 |
| authorships[2].affiliations[0].raw_affiliation_string | KU Leuven |
| authorships[2].institutions[0].id | https://openalex.org/I99464096 |
| authorships[2].institutions[0].ror | https://ror.org/05f950310 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I99464096 |
| authorships[2].institutions[0].country_code | BE |
| authorships[2].institutions[0].display_name | KU Leuven |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Guns, Tias |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | KU Leuven |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.5281/zenodo.17800138 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-12-10T00:00:00 |
| display_name | DCP-Bench-Open |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-12-10T02:49:46.989445 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.5281/zenodo.17800138 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400562 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Zenodo (CERN European Organization for Nuclear Research) |
| best_oa_location.source.host_organization | https://openalex.org/I67311998 |
| best_oa_location.source.host_organization_name | European Organization for Nuclear Research |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I67311998 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | |
| best_oa_location.raw_type | dataset |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.5281/zenodo.17800138 |
| primary_location.id | doi:10.5281/zenodo.17800138 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400562 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Zenodo (CERN European Organization for Nuclear Research) |
| primary_location.source.host_organization | https://openalex.org/I67311998 |
| primary_location.source.host_organization_name | European Organization for Nuclear Research |
| primary_location.source.host_organization_lineage | https://openalex.org/I67311998 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | |
| primary_location.raw_type | dataset |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.5281/zenodo.17800138 |
| publication_date | 2025-12-03 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 7, 53, 155 |
| abstract_inverted_index.AI | 84 |
| abstract_inverted_index.an | 78, 135, 167 |
| abstract_inverted_index.as | 32, 34, 77, 166 |
| abstract_inverted_index.at | 175 |
| abstract_inverted_index.be | 128 |
| abstract_inverted_index.in | 88, 119, 158 |
| abstract_inverted_index.is | 1, 6, 134 |
| abstract_inverted_index.of | 10, 56, 169 |
| abstract_inverted_index.or | 122 |
| abstract_inverted_index.to | 91 |
| abstract_inverted_index.(no | 39 |
| abstract_inverted_index.For | 151 |
| abstract_inverted_index.The | 111 |
| abstract_inverted_index.and | 18, 43, 60, 71, 125, 145 |
| abstract_inverted_index.are | 105 |
| abstract_inverted_index.can | 114, 127 |
| abstract_inverted_index.for | 81 |
| abstract_inverted_index.has | 47 |
| abstract_inverted_index.the | 2, 27, 35, 100, 102, 108, 170 |
| abstract_inverted_index.two | 48 |
| abstract_inverted_index.use | 154 |
| abstract_inverted_index.(CP) | 30 |
| abstract_inverted_index.(see | 161 |
| abstract_inverted_index.**To | 51, 75 |
| abstract_inverted_index.ECAI | 176 |
| abstract_inverted_index.Here | 0 |
| abstract_inverted_index.Many | 22 |
| abstract_inverted_index.This | 163 |
| abstract_inverted_index.come | 25 |
| abstract_inverted_index.data | 69, 143 |
| abstract_inverted_index.from | 26, 96, 148 |
| abstract_inverted_index.more | 126 |
| abstract_inverted_index.only | 15 |
| abstract_inverted_index.open | 136 |
| abstract_inverted_index.that | 139 |
| abstract_inverted_index.well | 33 |
| abstract_inverted_index.with | 14, 130 |
| abstract_inverted_index.your | 159 |
| abstract_inverted_index.(e.g. | 86 |
| abstract_inverted_index.2025. | 177 |
| abstract_inverted_index.CPMpy | 109 |
| abstract_inverted_index.LLMs) | 87 |
| abstract_inverted_index.added | 129 |
| abstract_inverted_index.clear | 64 |
| abstract_inverted_index.serve | 76 |
| abstract_inverted_index.their | 89 |
| abstract_inverted_index.using | 107 |
| abstract_inverted_index.CP-SAT | 124 |
| abstract_inverted_index.CPMpy, | 120 |
| abstract_inverted_index.GitHub | 3 |
| abstract_inverted_index.always | 153 |
| abstract_inverted_index.models | 95, 104, 118 |
| abstract_inverted_index.source | 137 |
| abstract_inverted_index.Boolean | 19 |
| abstract_inverted_index.Integer | 36 |
| abstract_inverted_index.ability | 90 |
| abstract_inverted_index.below). | 162 |
| abstract_inverted_index.integer | 17 |
| abstract_inverted_index.limited | 131 |
| abstract_inverted_index.natural | 65, 97 |
| abstract_inverted_index.primary | 49 |
| abstract_inverted_index.problem | 23 |
| abstract_inverted_index.project | 138, 164 |
| abstract_inverted_index.provide | 52 |
| abstract_inverted_index.started | 165 |
| abstract_inverted_index.systems | 85 |
| abstract_inverted_index.tooling | 147 |
| abstract_inverted_index.CP-Bench | 172 |
| abstract_inverted_index.Discrete | 11 |
| abstract_inverted_index.MiniZinc | 121 |
| abstract_inverted_index.Or-Tools | 123 |
| abstract_inverted_index.decision | 20 |
| abstract_inverted_index.discrete | 57 |
| abstract_inverted_index.evaluate | 116 |
| abstract_inverted_index.generate | 92 |
| abstract_inverted_index.goals:1. | 50 |
| abstract_inverted_index.language | 66, 98 |
| abstract_inverted_index.library. | 110 |
| abstract_inverted_index.original | 171 |
| abstract_inverted_index.research | 160 |
| abstract_inverted_index.specific | 156 |
| abstract_inverted_index.welcomes | 140 |
| abstract_inverted_index.'Release' | 157 |
| abstract_inverted_index.Problems, | 13 |
| abstract_inverted_index.benchmark | 9, 46, 133 |
| abstract_inverted_index.community | 38 |
| abstract_inverted_index.extension | 168 |
| abstract_inverted_index.framework | 113 |
| abstract_inverted_index.generated | 117 |
| abstract_inverted_index.including | 63 |
| abstract_inverted_index.instances | 70, 144 |
| abstract_inverted_index.involving | 16 |
| abstract_inverted_index.models.2. | 74 |
| abstract_inverted_index.problems, | 62, 142 |
| abstract_inverted_index.published | 174 |
| abstract_inverted_index.Constraint | 28 |
| abstract_inverted_index.additional | 141 |
| abstract_inverted_index.community, | 31 |
| abstract_inverted_index.constraint | 73, 94 |
| abstract_inverted_index.continuous | 40 |
| abstract_inverted_index.evaluating | 82 |
| abstract_inverted_index.evaluation | 79, 112, 146 |
| abstract_inverted_index.executable | 93 |
| abstract_inverted_index.generative | 83 |
| abstract_inverted_index.interested | 149 |
| abstract_inverted_index.variables. | 21 |
| abstract_inverted_index.(currently) | 106, 115 |
| abstract_inverted_index.Programming | 29, 37 |
| abstract_inverted_index.centralized | 54 |
| abstract_inverted_index.developers. | 150 |
| abstract_inverted_index.effort.This | 132 |
| abstract_inverted_index.framework** | 80 |
| abstract_inverted_index.repository, | 101 |
| abstract_inverted_index.repository: | 4 |
| abstract_inverted_index.variables), | 41 |
| abstract_inverted_index.formulations | 24 |
| abstract_inverted_index.ground-truth | 72, 103 |
| abstract_inverted_index.optimisation | 59 |
| abstract_inverted_index.repository** | 55 |
| abstract_inverted_index.satisfaction | 61 |
| abstract_inverted_index.Combinatorial | 12 |
| abstract_inverted_index.collaborative | 8 |
| abstract_inverted_index.combinatorial | 58 |
| abstract_inverted_index.corresponding | 68 |
| abstract_inverted_index.descriptions, | 67 |
| abstract_inverted_index.Pseudo-Boolean | 42 |
| abstract_inverted_index.Satisfiability | 44 |
| abstract_inverted_index.descriptions.In | 99 |
| abstract_inverted_index.communities.This | 45 |
| abstract_inverted_index.reproducability, | 152 |
| abstract_inverted_index.(https://huggingface.co/datasets/kostis-init/CP-Bench) | 173 |
| abstract_inverted_index.https://github.com/DCP-Bench/DCP-Bench-OpenDCP-Bench-Open | 5 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile |