{"id":"https://openalex.org/W4416013682","doi":"https://doi.org/10.1609/aiide.v21i1.36810","title":"Detecting Duplicate States Is Worth It in Narrative Planning with Belief","display_name":"Detecting Duplicate States Is Worth It in Narrative Planning with Belief","publication_year":2025,"publication_date":"2025-11-07","ids":{"openalex":"https://openalex.org/W4416013682","doi":"https://doi.org/10.1609/aiide.v21i1.36810"},"language":null,"primary_location":{"id":"doi:10.1609/aiide.v21i1.36810","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aiide.v21i1.36810","pdf_url":"https://ojs.aaai.org/index.php/AIIDE/article/download/36810/38948","source":{"id":"https://openalex.org/S4387284112","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","issn_l":"2326-909X","issn":["2326-909X","2334-0924"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://ojs.aaai.org/index.php/AIIDE/article/download/36810/38948","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008275929","display_name":"Fairoz Nower Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fairoz Nower Khan","raw_affiliation_strings":["University of Kentucky"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kentucky","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120300536","display_name":"Nabuat Zaman Nahim","orcid":null},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nabuat Zaman Nahim","raw_affiliation_strings":["University of Kentucky"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kentucky","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042069062","display_name":"Stephen G. Ware","orcid":"https://orcid.org/0000-0002-6640-8514"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen G. Ware","raw_affiliation_strings":["University of Kentucky"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kentucky","institution_ids":["https://openalex.org/I143302722"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030407322","display_name":"Judy Goldsmith","orcid":"https://orcid.org/0000-0002-8383-5390"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Judy Goldsmith","raw_affiliation_strings":["University of Kentucky"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kentucky","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28360501,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"1","first_page":"62","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.5688999891281128,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.5688999891281128,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.3379000127315521,"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/T12461","display_name":"Narrative Theory and Analysis","score":0.021199999377131462,"subfield":{"id":"https://openalex.org/subfields/1208","display_name":"Literature and Literary Theory"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/narrative","display_name":"Narrative","score":0.538100004196167},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5037999749183655},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5011000037193298},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.44290000200271606},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.424699991941452},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41019999980926514}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5443000197410583},{"id":"https://openalex.org/C199033989","wikidata":"https://www.wikidata.org/wiki/Q1318295","display_name":"Narrative","level":2,"score":0.538100004196167},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5037999749183655},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5011000037193298},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4447000026702881},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.424699991941452},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33340001106262207},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3222000002861023},{"id":"https://openalex.org/C2987255567","wikidata":"https://www.wikidata.org/wiki/Q33002955","display_name":"Knowledge graph","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.260699987411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aiide.v21i1.36810","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aiide.v21i1.36810","pdf_url":"https://ojs.aaai.org/index.php/AIIDE/article/download/36810/38948","source":{"id":"https://openalex.org/S4387284112","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","issn_l":"2326-909X","issn":["2326-909X","2334-0924"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aiide.v21i1.36810","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aiide.v21i1.36810","pdf_url":"https://ojs.aaai.org/index.php/AIIDE/article/download/36810/38948","source":{"id":"https://openalex.org/S4387284112","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","issn_l":"2326-909X","issn":["2326-909X","2334-0924"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5680223978","display_name":"CAREER: Structured High-Agency Interactive Narratives for Virtual Environments","funder_award_id":"2145153","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416013682.pdf","grobid_xml":"https://content.openalex.org/works/W4416013682.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Narrative":[0],"planning":[1,155,170],"algorithms":[2],"generate":[3],"stories":[4],"as":[5],"a":[6,121,132],"sequence":[7],"of":[8,29,89,149],"actions":[9],"that":[10,142,164],"align":[11],"with":[12],"an":[13],"author-defined":[14],"goal":[15],"while":[16],"ensuring":[17],"characters":[18],"act":[19],"believably,":[20],"often":[21],"requiring":[22],"reasoning":[23],"over":[24],"nested":[25,100],"beliefs.":[26],"When":[27],"theory":[28],"mind":[30],"is":[31,72,76,171],"represented,":[32],"states":[33,61,138],"include":[34],"not":[35,111],"only":[36],"the":[37,46,67,85,94,147,153],"factual":[38],"world":[39,47],"but":[40,70],"also":[41],"each":[42],"character\u2019s":[43],"beliefs":[44,101],"about":[45],"and":[48,87,116,127,139,152,174],"other":[49],"characters'":[50],"beliefs,":[51],"potentially":[52],"to":[53,80,125],"infinite":[54],"depth.":[55],"In":[56],"such":[57],"planners,":[58],"detecting":[59,136],"duplicate":[60,90,114,137,165],"can":[62],"prune":[63],"redundant":[64],"paths":[65],"in":[66,167],"search":[68],"space,":[69],"it":[71,75,144],"unclear":[73],"whether":[74],"too":[77],"computationally":[78],"expensive":[79],"justify.":[81],"This":[82],"paper":[83],"investigates":[84],"cost":[86],"benefit":[88],"state":[91],"detection":[92,166],"using":[93,143],"Sabre":[95],"planner,":[96],"which":[97,109,119],"models":[98],"infinitely":[99],"deterministically.":[102],"We":[103,130],"compare":[104],"two":[105],"approaches:":[106],"tree":[107],"search,":[108,118],"does":[110],"check":[112],"for":[113,135],"states,":[115],"graph":[117],"uses":[120],"recursive":[122],"equivalence":[123],"algorithm":[124,134],"detect":[126],"avoid":[128],"duplicates.":[129],"provide":[131],"polynomial-time":[133],"empirically":[140],"show":[141],"significantly":[145],"reduces":[146],"number":[148],"nodes":[150],"generated":[151],"total":[154],"time":[156],"across":[157],"several":[158],"benchmark":[159],"problems.":[160],"These":[161],"findings":[162],"suggest":[163],"epistemic":[168],"narrative":[169],"both":[172],"feasible":[173],"beneficial.":[175]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-11-07T00:00:00"}