{"id":"W3011683765","doi":"10.1613/jair.1.11659","title":"Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Computer science; Leverage (statistics); Task (project management); Heuristic; Representation (politics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","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.00414492,0.000189094,0.0003372313,0.0004397322,0.0004976558,0.0006323654,0.002231668,0.0001180436,0.00003509636],"category_scores_gemma":[0.00428251,0.0001471198,0.0001172626,0.001548661,0.0001613527,0.0005553955,0.0003297217,0.001603207,0.00005762559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009740188,"about_ca_system_score_gemma":0.0007357866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002483814,"about_ca_topic_score_gemma":0.000007389922,"domain_scores_codex":[0.9958376,0.0003937468,0.000854191,0.0003797274,0.001845816,0.0006889636],"domain_scores_gemma":[0.9943739,0.003000933,0.0003519157,0.0005050061,0.001245942,0.0005223196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001647143,0.0002866326,0.00597448,0.0001444955,0.0001031265,0.003534084,0.008422214,0.3401163,0.006476133,0.01354526,0.01141375,0.6083364],"study_design_scores_gemma":[0.0001438913,0.002469205,0.0001511736,0.0007649458,0.00001245332,0.00007332097,0.0005918031,0.9549497,0.02122751,0.01783551,0.001502096,0.000278378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03021815,0.0004755991,0.9639488,0.004741142,0.0002059283,0.0001346718,0.000002442443,0.00005130176,0.0002219211],"genre_scores_gemma":[0.7827076,0.00002393036,0.2166831,0.0002076147,0.0003482327,0.000002398,7.312487e-7,0.00001873581,0.000007669335],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7524894,"threshold_uncertainty_score":0.6965226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.19278465288359,"score_gpt":0.3880335451590027,"score_spread":0.1952488922754127,"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."}}