{"id":"W1581178003","doi":"10.1007/3-540-45622-8_27","title":"Using Abstraction for Heuristic Search and Planning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Incremental heuristic search; Abstraction; Null-move heuristic; Consistent heuristic; Beam search; Estimator; Factor (programming language); Search algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Algorithm; Programming language; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008573483,0.00034548,0.0003359073,0.0006034825,0.0004682987,0.000594609,0.001010283,0.0002519554,0.000006620292],"category_scores_gemma":[0.00009029404,0.0003412633,0.00006306846,0.0002536835,0.000266413,0.0004503904,0.0004051431,0.0006603347,0.000006236853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657466,"about_ca_system_score_gemma":0.0002108795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002843645,"about_ca_topic_score_gemma":0.00000374531,"domain_scores_codex":[0.99747,0.00002205628,0.0003379618,0.00108929,0.0005122147,0.0005685451],"domain_scores_gemma":[0.998153,0.0008391856,0.0001506871,0.0005442534,0.000172011,0.0001408567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000903105,0.00001468744,0.000240008,0.0001785989,0.00001330387,0.0001013046,0.001679553,0.5735015,0.0001906568,0.004588333,0.00003509711,0.419448],"study_design_scores_gemma":[0.0001674303,0.000106562,0.00008103037,0.0006883222,0.000007171859,0.0001100458,2.123665e-7,0.9735983,0.0002573016,0.02418881,0.0003991784,0.0003956479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003978893,0.0007973293,0.9965111,0.0001854487,0.0009883627,0.0003006304,0.000005621616,0.0001109738,0.0007026474],"genre_scores_gemma":[0.1773717,0.0000200237,0.8213554,0.0003983374,0.0005708635,0.000005063729,0.000004989288,0.00003417547,0.0002393826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4190523,"threshold_uncertainty_score":0.9999039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07126629346759994,"score_gpt":0.302729903603125,"score_spread":0.2314636101355251,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}