{"id":"https://openalex.org/W2090435952","doi":"https://doi.org/10.1145/1671970.1671972","title":"sgen1","display_name":"sgen1","publication_year":2010,"publication_date":"2010-02-02","ids":{"openalex":"https://openalex.org/W2090435952","doi":"https://doi.org/10.1145/1671970.1671972","mag":"2090435952"},"language":"en","primary_location":{"id":"doi:10.1145/1671970.1671972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1671970.1671972","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queen's University 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.3383,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.63523253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7372583150863647},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.6332202553749084},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4899434447288513},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4862469434738159},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36327555775642395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3265541195869446},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.06692495942115784}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7372583150863647},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.6332202553749084},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4899434447288513},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4862469434738159},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36327555775642395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3265541195869446},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.06692495942115784},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1671970.1671972","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1671970.1671972","pdf_url":null,"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:publications/cadec352-6181-41fc-8afa-78beb9aa8926","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=76649128096&partnerID=8YFLogxK","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Spence, I 2010, 'sgen1: A generator of small but difficult satisfiability benchmarks', ACM Journal of Experimental Algorithmics, vol. 15, no. null, 1.2, pp. 1.2:1-1.2:15. https://doi.org/10.1145/1671970.1671972","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W157060868","https://openalex.org/W1518056084","https://openalex.org/W1518705996","https://openalex.org/W1574451223","https://openalex.org/W1599171392","https://openalex.org/W1667344301","https://openalex.org/W1923495615","https://openalex.org/W1973898358","https://openalex.org/W1979903718","https://openalex.org/W1990734013","https://openalex.org/W2024060531","https://openalex.org/W2036265926","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2081755898","https://openalex.org/W2091469954","https://openalex.org/W2108508582","https://openalex.org/W2113201637","https://openalex.org/W2119027206","https://openalex.org/W2124587220","https://openalex.org/W2157661807"],"related_works":["https://openalex.org/W3127941413","https://openalex.org/W3155949217","https://openalex.org/W2404668260","https://openalex.org/W1531165611","https://openalex.org/W2212155158","https://openalex.org/W2117005051","https://openalex.org/W2772008579","https://openalex.org/W1568496597","https://openalex.org/W2480714386","https://openalex.org/W2109577721"],"abstract_inverted_index":{"The":[0],"satisfiability":[1],"problem":[2,14],"is":[3],"known":[4],"to":[5,22,65,102],"be":[6,11,40],"NP-Complete;":[7],"therefore,":[8],"there":[9],"should":[10],"relatively":[12],"small":[13],"instances":[15],"that":[16,30,53,62],"take":[17,63],"a":[18,51],"very":[19],"long":[20],"time":[21],"solve.":[23],"However,":[24],"most":[25,74,97],"of":[26,92],"the":[27,36,72,79,90,96],"smaller":[28],"benchmarks":[29,82,104],"were":[31,83],"once":[32],"thought":[33],"challenging,":[34],"especially":[35],"satisfiable":[37,60],"ones,":[38],"can":[39],"processed":[41],"quickly":[42],"by":[43,85],"modern":[44],"SAT-solvers.":[45],"We":[46,88],"describe":[47],"and":[48,105],"make":[49],"available":[50],"generator":[52],"produces":[54],"both":[55],"unsatisfiable":[56],"and,":[57],"more":[58,110],"significantly,":[59],"formulae":[61],"longer":[64],"solve":[66],"than":[67],"any":[68],"others":[69],"known.":[70],"At":[71],"two":[73],"recent":[75,98],"international":[76],"SAT":[77],"Competitions,":[78],"smallest":[80],"unsolved":[81],"created":[84],"this":[86],"generator.":[87],"analyze":[89],"results":[91],"all":[93],"solvers":[94],"in":[95],"competition":[99],"when":[100],"applied":[101],"these":[103],"also":[106],"present":[107],"our":[108],"own":[109],"focused":[111],"experiments.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}