{"id":"https://openalex.org/W109854102","doi":null,"title":"On the complexity of domain-independent planning","display_name":"On the complexity of domain-independent planning","publication_year":1992,"publication_date":"1992-07-12","ids":{"openalex":"https://openalex.org/W109854102","mag":"109854102"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.7780","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.7780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~nau/papers/erol92complexity.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5001013479","display_name":"Kutluhan Erol","orcid":"https://orcid.org/0000-0003-1816-5877","observed_orcids":["https://orcid.org/0000-0003-1816-5877"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kutluhan Erol","raw_affiliation_strings":["Computer Science Dept, University of Maryland, College Park, MD#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-1816-5877","affiliations":[{"raw_affiliation_string":"Computer Science Dept, University of Maryland, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084686808","display_name":"Dana S. Nau","orcid":"https://orcid.org/0000-0001-6940-6293","observed_orcids":["https://orcid.org/0000-0001-6940-6293"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana S. Nau","raw_affiliation_strings":["Computer Science Department, University of Maryland, College Park, MD and Systems Research Center and Institute for Advanced Computer Studies#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-6940-6293","affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland, College Park, MD and Systems Research Center and Institute for Advanced Computer Studies#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038645035","display_name":"V. S. Subrahmanian","orcid":"https://orcid.org/0000-0001-7191-0296","observed_orcids":["https://orcid.org/0000-0001-7191-0296"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. S. Subrahmanian","raw_affiliation_strings":["Computer Science Department, University of Maryland, College Park, MD and Institute for Advanced Computer Studies#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-7191-0296","affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland, College Park, MD and Institute for Advanced Computer Studies#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":6.6134,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.9642085,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"381","last_page":"386"},"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.9965999722480774,"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.9965999722480774,"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.0015999999595806003,"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.0006000000284984708,"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/domain-independent-planning","display_name":"domain-independent planning","score":0.9900000095367432},{"id":"https://openalex.org/keywords/planning-complexity","display_name":"planning complexity","score":0.593999981880188},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.7490000128746033},{"id":"https://openalex.org/keywords/planning-operators","display_name":"planning operators","score":0.5490000247955322},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6179999709129333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6240203380584717},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6178819537162781},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5852356553077698},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5110893845558167},{"id":"https://openalex.org/C200925200","wikidata":"https://www.wikidata.org/wiki/Q7624170","display_name":"STRIPS","level":2,"score":0.45820048451423645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43345749378204346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2764773964881897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2724289000034332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20616623759269714},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.7780","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.7780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~nau/papers/erol92complexity.pdf","raw_type":"text"},{"id":"mag:109854102","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.umd.edu/~nau/papers/erol1992complexity.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W129916058","https://openalex.org/W138166063","https://openalex.org/W141377150","https://openalex.org/W1491690797","https://openalex.org/W1555696599","https://openalex.org/W1569731694","https://openalex.org/W1577254100","https://openalex.org/W1655990431","https://openalex.org/W1663018970","https://openalex.org/W2011039300","https://openalex.org/W2022090818","https://openalex.org/W2029948740","https://openalex.org/W2054497239","https://openalex.org/W2133572125","https://openalex.org/W2152475379","https://openalex.org/W2171798962","https://openalex.org/W2329095262"],"related_works":["https://openalex.org/W7100494114","https://openalex.org/W2022090818","https://openalex.org/W280201951","https://openalex.org/W2950991144","https://openalex.org/W181299697","https://openalex.org/W7098378869","https://openalex.org/W48448421","https://openalex.org/W1479913975","https://openalex.org/W1499973835","https://openalex.org/W7096831943"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"examine":[4],"how":[5,24],"the":[6,16,19,25,56,67,75,78],"complexity":[7,27],"of":[8,18,34,74],"domain-independent":[9],"planning":[10,20,68,79],"with":[11],"strips-style":[12],"operators":[13,69],"depends":[14],"on":[15,30],"nature":[17],"operators.":[21],"We":[22],"show":[23],"time":[26],"varies":[28],"depending":[29],"a":[31],"wide":[32],"variety":[33],"conditions:":[35],"\u2022":[36,44,52,65],"whether":[37,45,53,66],"or":[38,46,54,81],"not":[39,47,55],"delete":[40],"lists":[41],"are":[42,50,58,70,83],"allowed;":[43,51],"negative":[48],"preconditions":[49],"predicates":[57],"restricted":[59],"to":[60,77],"be":[61],"propositions":[62],"(i.e.,":[63],"0-ary);":[64],"given":[71],"as":[72],"part":[73],"input":[76],"problem,":[80],"instead":[82],"fixed":[84],"in":[85],"advance.":[86]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}