{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007637737,0.0001723879,0.0002175406,0.0001463158,0.0002048985,0.0002552563,0.001233495,0.00009113469,0.00002908187],"category_scores_gemma":[0.0008534418,0.0001301038,0.00009424861,0.0004335007,0.0002375781,0.0003240801,0.0002418946,0.0006290147,0.00003119421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001641307,"about_ca_system_score_gemma":0.0001156944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000195064,"about_ca_topic_score_gemma":0.0000153333,"domain_scores_codex":[0.9982958,0.00001859803,0.0004940922,0.0003784807,0.0005166274,0.0002963292],"domain_scores_gemma":[0.9982394,0.0002617683,0.0004744238,0.0003220224,0.0006132894,0.00008911981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006098066,0.0001537918,0.001563642,0.00006321285,0.00001205056,5.20999e-7,0.001735215,0.002141694,0.2841086,0.6575173,0.00004792583,0.05259508],"study_design_scores_gemma":[0.00002188748,0.0001308979,0.001062808,0.0002791476,0.00001022152,0.00000842221,0.0001242788,0.3771178,0.5941393,0.02679728,0.0001277879,0.0001802101],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9300269,0.000005158767,0.06443714,0.001159846,0.0006398947,0.0002962749,0.000004926488,0.00009335618,0.003336452],"genre_scores_gemma":[0.9835921,0.000003525646,0.0161851,0.00005208256,0.0000458726,0.000007668565,3.524005e-7,0.000009458448,0.0001038488],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.63072,"threshold_uncertainty_score":0.5305481,"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."}}