{"id":"https://openalex.org/W240242295","doi":null,"title":"Correct abstraction in counter-planning: a knowledge compilation approach","display_name":"Correct abstraction in counter-planning: a knowledge compilation approach","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W240242295","mag":"240242295"},"language":"en","primary_location":{"id":"mag:240242295","doi":null,"is_oa":false,"landing_page_url":"https://ir.library.oregonstate.edu/xmlui/handle/1957/36260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"dissertation","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/A5033749663","display_name":"Nicholas S. Flann","orcid":"https://orcid.org/0000-0002-3100-8545","observed_orcids":["https://orcid.org/0000-0002-3100-8545"]},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicholas S. Flann","raw_affiliation_strings":["Oregon State University, Corvallis"],"raw_orcid":"https://orcid.org/0000-0002-3100-8545","affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033749663"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9765999913215637,"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.9765999913215637,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.022199999541044235,"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.0003000000142492354,"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/knowledge-compilation","display_name":"knowledge compilation","score":0.8240000009536743},{"id":"https://openalex.org/keywords/abstraction","display_name":"abstraction","score":0.6079999804496765},{"id":"https://openalex.org/keywords/equivalence-classes","display_name":"equivalence classes","score":0.878000020980835},{"id":"https://openalex.org/keywords/best-first-search","display_name":"best-first search","score":0.7960000038146973},{"id":"https://openalex.org/keywords/chess","display_name":"chess","score":0.3959999978542328},{"id":"https://openalex.org/keywords/checkers","display_name":"checkers","score":1.0},{"id":"https://openalex.org/keywords/search-space-reduction","display_name":"search space reduction","score":0.5450000166893005},{"id":"https://openalex.org/keywords/heuristic-control","display_name":"heuristic control","score":0.38499999046325684},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.7419999837875366},{"id":"https://openalex.org/keywords/automatic-rule-generation","display_name":"automatic rule generation","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7345801591873169},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6202975511550903},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5933414697647095},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5655452609062195},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5168155431747437},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.50238037109375},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.48246505856513977},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47480645775794983},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41080060601234436},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3092082440853119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16861498355865479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:240242295","doi":null,"is_oa":false,"landing_page_url":"https://ir.library.oregonstate.edu/xmlui/handle/1957/36260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6894219330","https://openalex.org/W1543368621","https://openalex.org/W2084335986","https://openalex.org/W3037839855","https://openalex.org/W2589042563","https://openalex.org/W2205190565","https://openalex.org/W1558870289","https://openalex.org/W1773969059","https://openalex.org/W2055486654","https://openalex.org/W50425026"],"abstract_inverted_index":{"Knowledge":[0],"compilation":[1],"improves":[2,14],"search-intensive":[3],"problem-solvers":[4,58],"that":[5,23,112,200,209,247,273],"are":[6,204],"easily":[7],"specified":[8],"but":[9],"inefficient.":[10],"One":[11],"promising":[12],"approach":[13,48,67],"efficiency":[15],"by":[16,34,124],"constructing":[17],"a":[18,158,193,207,239,268],"database":[19,31,81,89],"of":[20,61,162,227,242,250,256,270],"problem-instance/best-action":[21],"pairs":[22],"replace":[24],"problem-solving":[25],"search":[26,39,120,181],"with":[27,92,131,143,167],"efficient":[28],"lookup.":[29],"The":[30,119],"is":[32,68,106,113,122,155,182],"constructed":[33],"reverse":[35,164],"enumeration--expanding":[36],"the":[37,43,66,75,80,83,88,103,134,138,149,152,163,176,180,186,189,196,223,228,251,254,261],"complete":[38],"space":[40,76,104,121],"backwards,":[41],"from":[42],"terminal":[44],"problem":[45,93,126],"instances.":[46],"This":[47],"has":[49,210],"been":[50,211],"used":[51],"successfully":[52],"in":[53,206,215],"counter-planning":[54,117],"to":[55,70,78,86,116,133,145,174,178,184,213,265,279],"construct":[56],"perfect":[57],"for":[59],"subdomains":[60],"chess":[62,216],"and":[63,82,137,195,217,225,233],"checkers.":[64,218],"However,":[65],"limited":[69],"small":[71,240],"problems":[72,98,169,214,232],"because":[73],"both":[74,222],"needed":[77,85,105,154],"store":[79],"time":[84,153,190],"generate":[87,267],"grow":[90],"exponentially":[91],"size.\r\nThis":[94],"thesis":[95],"addresses":[96],"these":[97],"through":[99,108,157],"two":[100,202,277],"mechanisms.":[101],"First,":[102],"reduced":[107,156],"an":[109],"abstraction":[110],"mechanism":[111],"especially":[114],"suited":[115],"domains.":[118],"abstracted":[123],"representing":[125],"states":[127],"as":[128,140],"equivalence":[129,141],"classes":[130,142],"respect":[132,144],"goal":[135],"achieved":[136,198],"operators":[139],"how":[146],"they":[147],"influence":[148],"goals.":[150],"Second,":[151],"hueristic":[159],"best-first":[160,257],"control":[161],"enumeration.":[165],"Since":[166],"larger":[168],"it":[170],"may":[171],"be":[172],"impractical":[173],"run":[175],"compiler":[177],"completion,":[179],"organized":[183],"optimize":[185],"tradeoff":[187],"between":[188],"spent":[191],"compiling":[192],"domain":[194],"coverage":[197],"over":[199],"domain.\r\nThese":[201],"mechanisms":[203],"implemented":[205],"system":[208],"applied":[212],"Empirical":[219],"results":[220],"demonstrate":[221],"strengths":[224],"weaknesses":[226],"approach.":[229],"In":[230,259],"most":[231,249],"80/20":[234],"rule":[235],"was":[236,263],"demonstrated,":[237],"where":[238],"number":[241],"patterns":[243],"were":[244],"identified":[245],"early":[246],"covered":[248],"domain,":[252],"justifying":[253],"use":[255],"search.":[258],"addition,":[260],"method":[262],"able":[264],"automatically":[266],"set":[269],"abstract":[271],"rules":[272],"had":[274],"previously":[275],"required":[276],"person-months":[278],"hand":[280],"engineer.":[281]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}