{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492584,0.001232322,0.001533417,0.001289452,0.0007638737,0.00234646,0.002046596,0.001105095,0.00800861],"category_scores_gemma":[0.005325523,0.001328865,0.002453038,0.002146062,0.002800947,0.005506539,0.003570477,0.00377781,0.001203806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188235,"about_ca_system_score_gemma":0.000994866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002860661,"about_ca_topic_score_gemma":0.003264621,"domain_scores_codex":[0.9986576,0.0005905268,0.00009429677,0.0001590057,0.000380578,0.0001180081],"domain_scores_gemma":[0.9980888,0.00123559,0.00006117297,0.0004804533,0.00008753251,0.00004648405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001614616,0.00004901478,0.0002373739,0.0004950936,0.0001194706,0.000149092,0.0004754432,0.1352082,0.001635293,0.6700926,0.004905598,0.1864713],"study_design_scores_gemma":[0.0000350238,0.00003412267,0.00007890989,0.00007258748,0.00006493384,0.00007076028,0.00005392412,0.1993032,0.001136532,0.7844718,0.01465292,0.00002530475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002660939,0.00101347,0.9883819,0.0001987198,0.00006914403,0.00003464755,0.00005867282,0.000486461,0.007095946],"genre_scores_gemma":[0.1544819,0.001822609,0.8365712,0.0001558464,0.0001174149,0.000236231,0.0003332126,0.0003148708,0.005966702],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00800861,"threshold_uncertainty_score":0.02679145,"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."}}