{"id":"https://openalex.org/W2966640145","doi":"https://doi.org/10.1017/s1471068419000395","title":"Domain-Independent Cost-Optimal Planning in ASP","display_name":"Domain-Independent Cost-Optimal Planning in ASP","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2966640145","doi":"https://doi.org/10.1017/s1471068419000395","mag":"2966640145"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000395","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000395","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1908.00112","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"DAVID SPIES","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"DAVID SPIES","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":null,"display_name":"JIA-HUAI YOU","orcid":"https://orcid.org/0000-0001-9372-4371"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JIA-HUAI YOU","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9372-4371","affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":null,"display_name":"RYAN HAYWARD","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"RYAN HAYWARD","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.3168,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69527372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"5-6","first_page":"1124","last_page":"1142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9276000261306763,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9276000261306763,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.01889999955892563,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.014499999582767487,"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/planner","display_name":"Planner","score":0.9649999737739563},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4659000039100647},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.3506999909877777},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.31130000948905945}],"concepts":[{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.9649999737739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7731000185012817},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4659000039100647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.399399995803833},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.3506999909877777},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.31130000948905945},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.28200000524520874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2395000010728836},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.22789999842643738}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068419000395","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000395","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1908.00112","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1908.00112","pdf_url":"https://arxiv.org/pdf/1908.00112","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1908.00112","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1908.00112","pdf_url":"https://arxiv.org/pdf/1908.00112","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1482524252","https://openalex.org/W1540013686","https://openalex.org/W1606891084","https://openalex.org/W1808487372","https://openalex.org/W2025460523","https://openalex.org/W2092211394","https://openalex.org/W2115181241","https://openalex.org/W2149361370","https://openalex.org/W2200283827","https://openalex.org/W2208493917","https://openalex.org/W2337392266","https://openalex.org/W2471277801","https://openalex.org/W2910476971","https://openalex.org/W6629127292","https://openalex.org/W6636866540","https://openalex.org/W6662797028","https://openalex.org/W6682269659","https://openalex.org/W6732439113","https://openalex.org/W6786156976","https://openalex.org/W6803767736"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"investigate":[2],"the":[3,100,104],"problem":[4],"of":[5,32,66,95],"cost-optimal":[6,19,63,86,107],"planning":[7,89,116],"in":[8,71,109,117],"ASP.":[9,118],"Current":[10],"ASP":[11,68],"planners":[12],"can":[13],"be":[14],"trivially":[15],"extended":[16],"to":[17,37,52,60,85,98],"a":[18,28,39,62],"one":[20],"by":[21],"adding":[22],"weak":[23],"constraints,":[24],"but":[25],"only":[26,105],"for":[27,114],"given":[29],"makespan":[30],"(number":[31],"steps).":[33],"It":[34],"is":[35,92],"desirable":[36],"have":[38],"planner":[40,64,108],"that":[41],"guarantees":[42],"global":[43],"optimality.":[44],"In":[45],"this":[46,54],"paper,":[47],"we":[48,57,78],"present":[49],"two":[50,67,101],"approaches":[51,102],"addressing":[53],"problem.":[55],"First,":[56],"show":[58],"how":[59],"engineer":[61],"composed":[65],"programs":[69],"running":[70],"parallel.":[72],"Using":[73],"lessons":[74],"learned":[75],"from":[76],"this,":[77],"then":[79],"develop":[80],"an":[81],"entirely":[82],"new":[83],"approach":[84],"planning,":[87],"stepless":[88,115],",":[90],"which":[91],"completely":[93],"free":[94],"makespan.":[96],"Experiments":[97],"compare":[99],"with":[103],"known":[106],"SAT":[110],"reveal":[111],"good":[112],"potentials":[113]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2019-08-13T00:00:00"}