{"id":"https://openalex.org/W2279798144","doi":"https://doi.org/10.3233/978-1-61499-098-7-240","title":"On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements","display_name":"On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2279798144","doi":"https://doi.org/10.3233/978-1-61499-098-7-240","mag":"2279798144"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-098-7-240","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-098-7-240","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/978-1-61499-098-7-240","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066158048","display_name":"Luk\u00e1\u0161 Chrpa","orcid":"https://orcid.org/0000-0001-9713-7748"},"institutions":[{"id":"https://openalex.org/I133837150","display_name":"University of Huddersfield","ror":"https://ror.org/05t1h8f27","country_code":"GB","type":"education","lineage":["https://openalex.org/I133837150"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Chrpa Luk&aacute;&scaron;","raw_affiliation_strings":["University of Huddersfield, UK"],"affiliations":[{"raw_affiliation_string":"University of Huddersfield, UK","institution_ids":["https://openalex.org/I133837150"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010229910","display_name":"T.L. McCluskey","orcid":"https://orcid.org/0000-0001-8181-8127"},"institutions":[{"id":"https://openalex.org/I133837150","display_name":"University of Huddersfield","ror":"https://ror.org/05t1h8f27","country_code":"GB","type":"education","lineage":["https://openalex.org/I133837150"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"McCluskey Thomas Leo","raw_affiliation_strings":["University of Huddersfield, UK"],"affiliations":[{"raw_affiliation_string":"University of Huddersfield, UK","institution_ids":["https://openalex.org/I133837150"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066158048"],"corresponding_institution_ids":["https://openalex.org/I133837150"],"apc_list":null,"apc_paid":null,"fwci":3.0384,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92746469,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"245"},"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.9993000030517578,"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.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9864000082015991,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9706000089645386,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48136669397354126},{"id":"https://openalex.org/keywords/cognitive-science","display_name":"Cognitive science","score":0.3278944492340088},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.22090277075767517}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48136669397354126},{"id":"https://openalex.org/C188147891","wikidata":"https://www.wikidata.org/wiki/Q147638","display_name":"Cognitive science","level":1,"score":0.3278944492340088},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.22090277075767517}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3233/978-1-61499-098-7-240","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-098-7-240","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/60a9a11b-51fd-41c6-a299-e2ac38fa4647","is_oa":false,"landing_page_url":"https://pure.hud.ac.uk/en/publications/60a9a11b-51fd-41c6-a299-e2ac38fa4647","pdf_url":null,"source":{"id":"https://openalex.org/S4306402508","display_name":"Huddersfield Research Portal (University of Huddersfield)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I133837150","host_organization_name":"University of Huddersfield","host_organization_lineage":["https://openalex.org/I133837150"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chrpa, L & McCluskey, T L 2012, On exploiting structures of classical planning problems : Generalizing entanglements. in ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration. vol. 242, Frontiers in Artificial Intelligence and Applications, vol. 242, IOS Press, pp. 240-245. https://doi.org/10.3233/978-1-61499-098-7-240","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.hud.ac.uk:15196","is_oa":true,"landing_page_url":null,"pdf_url":"http://eprints.hud.ac.uk/id/eprint/15196/6/FAIA242-0240.pdf","source":{"id":"https://openalex.org/S4306401852","display_name":"University of Huddersfield Repository (University of Huddersfield)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I133837150","host_organization_name":"University of Huddersfield","host_organization_lineage":["https://openalex.org/I133837150"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Chapter"},{"id":"mag:2279798144","is_oa":false,"landing_page_url":"http://eprints.hud.ac.uk/15196/6/FAIA242%2D0240.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418308","display_name":"European Conference on Artificial Intelligence","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":{"id":"doi:10.3233/978-1-61499-098-7-240","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-61499-098-7-240","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W74144133","https://openalex.org/W125541279","https://openalex.org/W145978091","https://openalex.org/W163797351","https://openalex.org/W1481195904","https://openalex.org/W1486994959","https://openalex.org/W1489183362","https://openalex.org/W1545688112","https://openalex.org/W1546138608","https://openalex.org/W1731763842","https://openalex.org/W1781384914","https://openalex.org/W1886279298","https://openalex.org/W2025460523","https://openalex.org/W2045526507","https://openalex.org/W2070183171","https://openalex.org/W2154550858","https://openalex.org/W2160927913","https://openalex.org/W2163854321","https://openalex.org/W2163883965","https://openalex.org/W2171798962","https://openalex.org/W2726883498","https://openalex.org/W3101355526","https://openalex.org/W3104718257","https://openalex.org/W3106271432","https://openalex.org/W3111885891","https://openalex.org/W6685061678","https://openalex.org/W6740759356","https://openalex.org/W6786039469"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Much":[0],"progress":[1],"has":[2],"been":[3,49],"made":[4],"in":[5,14,20,34,81],"the":[6,36,89,93,98,182,189],"research":[7,78],"and":[8,45,119,126,148,153,168,184,195],"development":[9],"of":[10,40,66,150,181,188],"automated":[11,53],"planning":[12,90,94,117,193],"algorithms":[13],"recent":[15],"years.":[16],"Though":[17],"incremental":[18],"improvements":[19],"algorithm":[21],"design":[22],"are":[23,32,57,69,124],"still":[24],"desirable,":[25],"complementary":[26],"approaches":[27],"such":[28,86,112],"as":[29,87],"problem":[30,95,99,174],"reformulation":[31],"important":[33],"tackling":[35],"high":[37],"computational":[38],"complexity":[39],"planning.":[41],"While":[42],"machine":[43],"learning":[44],"adaptive":[46],"techniques":[47,85],"have":[48],"usefully":[50],"applied":[51],"to":[52,60,71,96,101,128,143,172],"planning,":[54],"these":[55],"advances":[56],"often":[58],"tied":[59],"a":[61,130,155,178],"particular":[62],"planner":[63],"or":[64,121],"class":[65],"planners":[67],"that":[68,73],"coded":[70],"exploit":[72],"learned":[74],"knowledge.":[75],"A":[76],"promising":[77],"direction":[79],"is":[80,110],"exploiting":[82],"knowledge":[83],"engineering":[84],"reformulating":[88],"domain":[91,131],"and/or":[92],"make":[97],"easier":[100],"solve":[102],"for":[103,157,164,169],"general,":[104],"state-of-the-art":[105,196],"planners.":[106,197],"Learning":[107],"(outer)":[108],"entanglements":[109,167],"one":[111],"technique,":[113],"where":[114],"relations":[115,145],"between":[116,146],"operators":[118,151],"initial":[120],"goal":[122],"atoms":[123,147],"learned,":[125],"used":[127],"reformulate":[129],"by":[132],"removing":[133],"unneeded":[134],"operator":[135],"instances.":[136],"Here":[137],"we":[138],"generalize":[139],"this":[140],"approach":[141],"significantly":[142],"cover":[144],"pairs":[149],"themselves,":[152],"develop":[154],"technique":[156],"producing":[158],"inner":[159,166],"entanglements.":[160],"We":[161,176],"present":[162],"methods":[163,190],"detecting":[165],"using":[170,191],"them":[171],"do":[173],"reformulation.":[175],"provide":[177],"theoretical":[179],"treatment":[180],"area,":[183],"an":[185],"empirical":[186],"evaluation":[187],"standard":[192],"benchmarks":[194]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-01-21T23:30:37.877113","created_date":"2025-10-10T00:00:00"}
