{"id":"https://openalex.org/W4243317326","doi":"https://doi.org/10.1109/aspdac.2004.1337719","title":"Satisfiability and integer programming as complementary tools","display_name":"Satisfiability and integer programming as complementary tools","publication_year":2005,"publication_date":"2005-04-12","ids":{"openalex":"https://openalex.org/W4243317326","doi":"https://doi.org/10.1109/aspdac.2004.1337719"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2004.1337719","doi":"https://doi.org/10.1109/aspdac.2004.1337719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2004.1337719","pdf_url":null,"source":{"id":"https://openalex.org/S4363608791","display_name":"Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5079130374","display_name":"Ruirning Li","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruirning Li","raw_affiliation_strings":["Department of Electrical Engineering School of Engineering and Computer Sciences, University of Texas, Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering School of Engineering and Computer Sciences, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054960059","display_name":"Dian Zhou","orcid":"https://orcid.org/0000-0002-2648-5232","observed_orcids":["https://orcid.org/0000-0002-2648-5232"]},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dian Zhou","raw_affiliation_strings":["Department of Electrical Engineering School of Engineering and Computer Sciences, University of Texas, Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering School of Engineering and Computer Sciences, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085441311","display_name":"Donglei Du","orcid":"https://orcid.org/0000-0003-0111-8572","observed_orcids":["https://orcid.org/0000-0003-0111-8572"]},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Donglei Du","raw_affiliation_strings":["Faculty of Administration, University of New Brunswick, Fredericton, NB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Administration, University of New Brunswick, Fredericton, NB, Canada","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"5","issue":null,"first_page":"880","last_page":"883"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.673799991607666,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.673799991607666,"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.20520000159740448,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.030300000682473183,"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.9359999895095825},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.9890000224113464},{"id":"https://openalex.org/keywords/sat-solvers","display_name":"SAT solvers","score":0.6299999952316284},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.878000020980835},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.4970000088214874}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.8645708560943604},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8010702133178711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6405903697013855},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6207672953605652},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5881006717681885},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.49399691820144653},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4212127923965454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40786927938461304},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35826820135116577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33064740896224976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2951005697250366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16945314407348633}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2004.1337719","doi":"https://doi.org/10.1109/aspdac.2004.1337719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2004.1337719","pdf_url":null,"source":{"id":"https://openalex.org/S4363608791","display_name":"Asia and South Pacific Design Automation Conference (ASP-DAC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2092883699","https://openalex.org/W2108637261","https://openalex.org/W2147442986","https://openalex.org/W2165858176","https://openalex.org/W2998050925"],"related_works":["https://openalex.org/W6921062810","https://openalex.org/W2152498238","https://openalex.org/W7095323190","https://openalex.org/W3013362614","https://openalex.org/W2572456734","https://openalex.org/W4417338885","https://openalex.org/W1595043500","https://openalex.org/W1520105804","https://openalex.org/W128420466","https://openalex.org/W2803061700"],"abstract_inverted_index":{"Satisfiability":[0],"(SAT)":[1],"and":[2,42,51],"integer":[3],"linear":[4],"programming":[5],"(ILP)":[6],"are":[7],"two":[8,59],"related":[9],"NP-complete":[10],"problems.":[11],"They":[12],"both":[13,69],"have":[14],"a":[15,27],"lot":[16],"of":[17,74,79],"important":[18],"applications.":[19],"We":[20,33],"study":[21],"the":[22,54],"effectivenessof":[23],"using":[24,65],"them":[25,44],"as":[26],"complementary":[28],"tool":[29],"to":[30,39,61],"each":[31],"other.":[32],"propose":[34],"three":[35],"different":[36],"ILP":[37,63],"formulations":[38],"solve":[40,62],"SAT":[41,48,66],"compare":[43],"with":[45],"state-ofthe-":[46],"art":[47],"solvers":[49],"Berkmin":[50],"zchaff.":[52],"On":[53],"other":[55],"hand,":[56],"we":[57,71],"give":[58],"methods":[60],"by":[64],"solvers.":[67],"In":[68],"cases,":[70],"achieve":[72],"speed-ups":[73],"several":[75],"orders":[76],"for":[77],"most":[78],"our":[80],"tested":[81],"examples.":[82]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2022-05-12T00:00:00"}