{"id":"https://openalex.org/W2043582016","doi":"https://doi.org/10.1145/2746239","title":"Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks","display_name":"Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks","publication_year":2015,"publication_date":"2015-05-27","ids":{"openalex":"https://openalex.org/W2043582016","doi":"https://doi.org/10.1145/2746239","mag":"2043582016"},"language":"en","primary_location":{"id":"doi:10.1145/2746239","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2746239","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2746239&type=pdf","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2746239&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049905270","display_name":"Ivor Spence","orcid":"https://orcid.org/0000-0002-0289-6790"},"institutions":[{"id":"https://openalex.org/I126231945","display_name":"Queen's University Belfast","ror":"https://ror.org/00hswnk62","country_code":"GB","type":"education","lineage":["https://openalex.org/I126231945"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ivor Spence","raw_affiliation_strings":["Queen's University Belfast, Belfast, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen's University Belfast, Belfast, United Kingdom","institution_ids":["https://openalex.org/I126231945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049905270"],"corresponding_institution_ids":["https://openalex.org/I126231945"],"apc_list":null,"apc_paid":null,"fwci":0.677,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74501768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7379699945449829},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7068374156951904},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.5331776738166809},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4951395094394684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47786134481430054},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4765232801437378},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.46760717034339905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4551411271095276},{"id":"https://openalex.org/keywords/margin","display_name":"Margin (machine learning)","score":0.42414620518684387},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40089067816734314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38077446818351746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33992713689804077},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09327012300491333}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7379699945449829},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7068374156951904},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.5331776738166809},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4951395094394684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47786134481430054},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4765232801437378},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.46760717034339905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4551411271095276},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.42414620518684387},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40089067816734314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38077446818351746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33992713689804077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09327012300491333},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2746239","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2746239","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2746239&type=pdf","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:pure.qub.ac.uk/portal:openaire/c2770eca-1199-4f04-aaa4-d677c3acc058","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/c2770eca-1199-4f04-aaa4-d677c3acc058","pdf_url":"https://pureadmin.qub.ac.uk/ws/files/14448749/spence2014_v3.pdf","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Spence, I 2015, 'Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks', ACM Journal of Experimental Algorithmics, vol. 20, 1.4. https://doi.org/10.1145/2746239","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/2746239","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2746239","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2746239&type=pdf","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2043582016.pdf","grobid_xml":"https://content.openalex.org/works/W2043582016.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W32539537","https://openalex.org/W48421743","https://openalex.org/W94961302","https://openalex.org/W1503773079","https://openalex.org/W2036265926","https://openalex.org/W2038193643","https://openalex.org/W2038690430","https://openalex.org/W2069767473","https://openalex.org/W2081755898","https://openalex.org/W2090435952","https://openalex.org/W2111224220","https://openalex.org/W2117188169","https://openalex.org/W2129596464","https://openalex.org/W2506963967"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2014111643"],"abstract_inverted_index":{"For":[0],"some":[1],"time,":[2],"the":[3,9,24,56,76,80,89,94],"satisfiability":[4],"formulae":[5,41,49,71],"that":[6,52],"have":[7,17,31],"been":[8,18],"most":[10,77],"difficult":[11,40,78],"to":[12,20,43,74],"solve":[13],"for":[14],"their":[15],"size":[16],"crafted":[19],"be":[21,61,75],"unsatisfiable":[22,48],"by":[23,83],"use":[25],"of":[26,35,47],"cardinality":[27,64],"constraints.":[28],"Recent":[29],"solvers":[30],"introduced":[32],"explicit":[33],"checking":[34],"such":[36],"constraints,":[37],"rendering":[38],"previously":[39],"trivial":[42],"solve.":[44],"A":[45],"family":[46,58],"is":[50,53],"described":[51],"derived":[54],"from":[55],"sgen4":[57],"but":[59],"cannot":[60],"solved":[62],"using":[63],"constraints":[65],"detection":[66],"and":[67,87],"reasoning":[68],"alone.":[69],"These":[70],"were":[72],"found":[73],"during":[79],"SAT2014":[81],"competition":[82],"a":[84],"significant":[85],"margin":[86],"include":[88],"shortest":[90],"unsolved":[91],"benchmark":[92],"in":[93],"competition,":[95],"sgen6-1200-5-1.cnf.":[96]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}