{"id":"W1505083629","doi":"10.1609/aaai.v24i1.7563","title":"Searching Without a Heuristic: Efficient Use of Abstraction","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristics; Heuristic; Incremental heuristic search; Null-move heuristic; Computer science; Abstraction; Consistent heuristic; Bidirectional search; Beam search; Search algorithm; Path (computing); Node (physics); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.002940743,0.001605947,0.00212604,0.001493777,0.0009131561,0.00222092,0.002753878,0.001467819,0.002561978],"category_scores_gemma":[0.01047055,0.0009203004,0.001537183,0.00219442,0.00162862,0.003813385,0.003303069,0.001990946,0.0007237356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170008,"about_ca_system_score_gemma":0.003233033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004439928,"about_ca_topic_score_gemma":0.004900439,"domain_scores_codex":[0.9977006,0.0008723565,0.0001791613,0.0003043951,0.0006838688,0.0002596441],"domain_scores_gemma":[0.995253,0.00246965,0.0003572826,0.00147394,0.0003043673,0.0001419297],"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.0004765041,0.0003125628,0.002269515,0.0003984526,0.0001636888,0.0002699775,0.0004479951,0.5449101,0.008592351,0.06430178,0.004366121,0.3734909],"study_design_scores_gemma":[0.00006844138,0.0001191473,0.0001997927,0.00003211622,0.00005008382,0.00006286648,0.00006691878,0.943907,0.002785941,0.05023553,0.002451001,0.00002126858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03637923,0.0004972467,0.9561883,0.000234496,0.00002859654,0.0002192292,0.0001053733,0.001879325,0.004468311],"genre_scores_gemma":[0.2927372,0.0003130839,0.7046966,0.0001401657,0.00002222651,0.0003208363,0.0003272755,0.0002499844,0.001192681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004439928,"threshold_uncertainty_score":0.01555234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09218876173904127,"score_gpt":0.3059573326956114,"score_spread":0.2137685709565701,"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."}}