{"id":"https://openalex.org/W4200412225","doi":"https://doi.org/10.1109/ictai52525.2021.00072","title":"Graph Neural Networks for Scheduling of SMT Solvers","display_name":"Graph Neural Networks for Scheduling of SMT Solvers","publication_year":2021,"publication_date":"2021-11-01","ids":{"openalex":"https://openalex.org/W4200412225","doi":"https://doi.org/10.1109/ictai52525.2021.00072"},"language":"en","primary_location":{"id":"doi:10.1109/ictai52525.2021.00072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictai52525.2021.00072","pdf_url":null,"source":{"id":"https://openalex.org/S4363608052","display_name":"2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)","raw_type":"proceedings-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/A5076891199","display_name":"Jan H\u016fla","orcid":"https://orcid.org/0000-0001-7639-864X"},"institutions":[{"id":"https://openalex.org/I187293425","display_name":"University of Ostrava","ror":"https://ror.org/00pyqav47","country_code":"CZ","type":"education","lineage":["https://openalex.org/I187293425"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Hula","raw_affiliation_strings":["University of Ostrava,Ostrava,Czechia","University of Ostrava, Ostrava, Czechia"],"affiliations":[{"raw_affiliation_string":"University of Ostrava,Ostrava,Czechia","institution_ids":["https://openalex.org/I187293425"]},{"raw_affiliation_string":"University of Ostrava, Ostrava, Czechia","institution_ids":["https://openalex.org/I187293425"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065303754","display_name":"David Moj\u017e\u00ed\u0161ek","orcid":"https://orcid.org/0000-0002-3867-644X"},"institutions":[{"id":"https://openalex.org/I187293425","display_name":"University of Ostrava","ror":"https://ror.org/00pyqav47","country_code":"CZ","type":"education","lineage":["https://openalex.org/I187293425"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"David Mojzisek","raw_affiliation_strings":["University of Ostrava,Ostrava,Czechia","University of Ostrava, Ostrava, Czechia"],"affiliations":[{"raw_affiliation_string":"University of Ostrava,Ostrava,Czechia","institution_ids":["https://openalex.org/I187293425"]},{"raw_affiliation_string":"University of Ostrava, Ostrava, Czechia","institution_ids":["https://openalex.org/I187293425"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083748570","display_name":"Mikol\u00e1\u0161 Janota","orcid":"https://orcid.org/0000-0003-3487-784X"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Mikolas Janota","raw_affiliation_strings":["Czech Technical University in Prague,Prague,Czechia","Czech Technical University in Prague, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague,Prague,Czechia","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Czech Technical University in Prague, Prague, Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076891199"],"corresponding_institution_ids":["https://openalex.org/I187293425"],"apc_list":null,"apc_paid":null,"fwci":1.54,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80318487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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/T10260","display_name":"Software Engineering Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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-modulo-theories","display_name":"Satisfiability modulo theories","score":0.840752363204956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.838424026966095},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6327394247055054},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5810818672180176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48767054080963135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46681711077690125},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4420813024044037},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.41068148612976074},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36352774500846863},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22095465660095215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1374504566192627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09215480089187622}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.840752363204956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.838424026966095},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6327394247055054},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5810818672180176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48767054080963135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46681711077690125},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4420813024044037},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.41068148612976074},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36352774500846863},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22095465660095215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1374504566192627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09215480089187622},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ictai52525.2021.00072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictai52525.2021.00072","pdf_url":null,"source":{"id":"https://openalex.org/S4363608052","display_name":"2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311687","display_name":"Ministry of Education","ror":"https://ror.org/03m01yf64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1481397690","https://openalex.org/W1522301498","https://openalex.org/W1776786831","https://openalex.org/W2042033151","https://openalex.org/W2086886584","https://openalex.org/W2147148915","https://openalex.org/W2159595840","https://openalex.org/W2401873228","https://openalex.org/W2589084440","https://openalex.org/W2752344401","https://openalex.org/W2768348081","https://openalex.org/W2786776430","https://openalex.org/W2795154181","https://openalex.org/W2898873842","https://openalex.org/W2921992864","https://openalex.org/W2962711740","https://openalex.org/W2964015378","https://openalex.org/W2997090216","https://openalex.org/W3022618186","https://openalex.org/W3033538074","https://openalex.org/W3188522200","https://openalex.org/W4206482253","https://openalex.org/W6628836516","https://openalex.org/W6631190155","https://openalex.org/W6683303659","https://openalex.org/W6726873649","https://openalex.org/W6743845106","https://openalex.org/W6745609711","https://openalex.org/W6748262478","https://openalex.org/W6754929296","https://openalex.org/W6760600999","https://openalex.org/W6777013734","https://openalex.org/W6778838815"],"related_works":["https://openalex.org/W4318620547","https://openalex.org/W2578463151","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W4386723279","https://openalex.org/W2048447692","https://openalex.org/W583460537","https://openalex.org/W2884361050","https://openalex.org/W2505717744"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"an":[3],"approach":[4,94],"to":[5,26,49,78,95],"the":[6,11,43,51,67,72,79,84,99,113],"scheduling":[7],"of":[8,13,53,112,115],"solvers":[9,55,73,89],"in":[10,42,110],"domain":[12],"Satisfiability":[14],"Modulo":[15],"Theories":[16],"(SMT)":[17],"using":[18],"a":[19,57,104],"Graph":[20],"Neural":[21],"Network":[22],"(GNN).":[23],"In":[24,98],"contrast":[25],"related":[27],"methods,":[28],"GNNs":[29],"do":[30],"not":[31],"require":[32],"manual":[33],"feature":[34],"design":[35],"as":[36],"they":[37],"enable":[38],"discovering":[39],"relevant":[40],"features":[41],"raw":[44],"data.":[45],"We":[46,91],"train":[47],"them":[48,76],"predict":[50],"effectivity":[52],"individual":[54],"on":[56],"given":[58],"problem.":[59],"Rather":[60],"than":[61],"choosing":[62],"only":[63],"one":[64],"solver":[65],"with":[66],"best":[68],"prediction,":[69],"we":[70,102],"schedule":[71],"by":[74],"ordering":[75],"according":[77],"predicted":[80],"runtime":[81,86],"and":[82,118],"dividing":[83],"overall":[85,119],"into":[87],"all":[88],"uniformly.":[90],"compare":[92],"our":[93],"several":[96],"baselines.":[97],"selected":[100],"benchmarks,":[101],"show":[103],"substantial":[105],"improvement":[106],"over":[107],"these":[108],"baselines":[109],"terms":[111],"number":[114],"solved":[116],"problems":[117],"solving":[120],"time.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}