{"id":"https://openalex.org/W2023295580","doi":"https://doi.org/10.1145/2658761.2658762","title":"Specializing planners for hierarchical multi-way dataflow constraint systems","display_name":"Specializing planners for hierarchical multi-way dataflow constraint systems","publication_year":2014,"publication_date":"2014-08-29","ids":{"openalex":"https://openalex.org/W2023295580","doi":"https://doi.org/10.1145/2658761.2658762","mag":"2023295580"},"language":"en","primary_location":{"id":"doi:10.1145/2658761.2658762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2658761.2658762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences","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/A5047665290","display_name":"Jaakko J\u00e4rvi","orcid":"https://orcid.org/0000-0002-3418-7366"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jaakko J\u00e4rvi","raw_affiliation_strings":["Texas A&M University, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071167426","display_name":"Gabriel Foust","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gabriel Foust","raw_affiliation_strings":["Texas A&M University, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100786124","display_name":"Magne Haveraaen","orcid":"https://orcid.org/0000-0003-0836-8347"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Magne Haveraaen","raw_affiliation_strings":["University of Bergen, Norway","University of Bergen , Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen , Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047665290"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.6896,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73776224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9902999997138977,"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.9842000007629395,"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/computer-science","display_name":"Computer science","score":0.8569371104240417},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.8001525402069092},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.733029305934906},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6920620203018188},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.685099720954895},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.608253002166748},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5138747692108154},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5098504424095154},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.47669240832328796},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38611018657684326},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38525134325027466},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35634952783584595},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15542101860046387},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.09697142243385315}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8569371104240417},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.8001525402069092},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.733029305934906},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6920620203018188},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.685099720954895},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.608253002166748},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5138747692108154},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5098504424095154},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.47669240832328796},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38611018657684326},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38525134325027466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35634952783584595},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15542101860046387},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.09697142243385315},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2658761.2658762","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2658761.2658762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1560028592","https://openalex.org/W1992337747","https://openalex.org/W1994650182","https://openalex.org/W2041311157","https://openalex.org/W2053637323","https://openalex.org/W2078328646","https://openalex.org/W2078404830","https://openalex.org/W2100599950","https://openalex.org/W2105655803","https://openalex.org/W2121147677","https://openalex.org/W2132233302","https://openalex.org/W2149907438","https://openalex.org/W2158148651","https://openalex.org/W2160796062","https://openalex.org/W2296513191","https://openalex.org/W2342091124","https://openalex.org/W2611093227","https://openalex.org/W4232896595","https://openalex.org/W4239720002","https://openalex.org/W4297938573","https://openalex.org/W6704462221"],"related_works":["https://openalex.org/W1531664660","https://openalex.org/W1980681296","https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1548409801","https://openalex.org/W200657494","https://openalex.org/W1514298554","https://openalex.org/W1496100162","https://openalex.org/W2495969191","https://openalex.org/W1567852657"],"abstract_inverted_index":{"A":[0],"constraint":[1,17,45,101,121,157,165],"system":[2,18],"consists":[3],"of":[4,9,32,52,64,76,80,86,140],"variables":[5],"and":[6,83],"a":[7,16,22,42,50,103,146,169],"set":[8,51],"constraints":[10,33,82,125],"on":[11],"those":[12,89],"variables.":[13],"To":[14],"solve":[15],"is":[19,68],"to":[20,113,173,179,184],"find":[21],"valuation":[23],"that":[24,181],"satisfies":[25],"all":[26,36],"constraints;":[27],"or":[28,142],"the":[29,60,78,81,97,124,151],"\"best\"":[30],"subset":[31],"if":[34],"not":[35],"can":[37,136,177],"simultaneously":[38],"be":[39,137],"satisfied.":[40],"In":[41],"multi-way":[43,119],"dataflow":[44,120],"system,":[46],"solving":[47],"requires":[48],"selecting":[49,65],"user-defined":[53],"functions":[54,67],"which,":[55],"when":[56,123],"executed,":[57],"will":[58],"enforce":[59],"constraints.":[61,90],"The":[62,71,91,130],"task":[63],"these":[66],"called":[69],"planning.":[70],"planner":[72,149],"has":[73],"two":[74],"kinds":[75],"input:":[77],"specification":[79],"an":[84,138],"order":[85,139],"priority":[87],"for":[88,106,117,150,156],"former":[92],"typically":[93],"changes":[94],"seldom,":[95],"while":[96],"latter":[98],"frequently,":[99],"making":[100],"planning":[102],"potential":[104],"application":[105],"program":[107],"specialization.":[108],"This":[109],"paper":[110],"shows":[111],"how":[112,168],"generate":[114],"specialized":[115,131],"planners":[116,132,176],"hierarchical":[118],"systems":[122,158,166],"are":[126,133,159,187],"known":[127],"in":[128,160],"advance.":[129],"DFAs;":[134],"they":[135],"magnitude":[141],"more":[143],"faster":[144],"than":[145],"general":[147],"purpose":[148],"same":[152],"system.":[153],"Our":[154],"applications":[155],"user":[161,174,185],"interface":[162],"programming,":[163],"where":[164],"determine":[167],"GUI":[170],"should":[171],"react":[172],"interaction---specialized":[175],"help":[178],"ensure":[180],"GUIs'":[182],"responses":[183],"interaction":[186],"instantaneous.":[188]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}