{"id":"W3037624080","doi":"10.1609/socs.v11i1.18529","title":"Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Heuristics; Constraint programming; Plan (archaeology); Computer science; Constraint (computer-aided design); Mathematical optimization; Combinatorial optimization; Class (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Stochastic programming","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.0007132744,0.0001532658,0.0001725125,0.0001330083,0.0003009765,0.0005652319,0.0007671046,0.0001037127,0.00001287752],"category_scores_gemma":[0.0001345669,0.0001364094,0.00008000037,0.0003315236,0.00008297025,0.0005740272,0.0008685203,0.0004976538,0.000001874217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002256974,"about_ca_system_score_gemma":0.0001821308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003765705,"about_ca_topic_score_gemma":7.366075e-7,"domain_scores_codex":[0.9976788,0.00003379618,0.0003373428,0.0004589033,0.001212824,0.0002782954],"domain_scores_gemma":[0.9986598,0.0001145991,0.0001038671,0.0001287323,0.0008876186,0.000105392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000109353,0.000261444,0.02681817,0.0001060632,0.0001393694,0.00001134873,0.003009275,0.307112,0.1837563,0.4767253,0.0001370291,0.001814352],"study_design_scores_gemma":[0.0007228552,0.00005344512,0.0005152819,0.0003089284,0.000008033023,0.00006367345,0.0001828782,0.9582077,0.0349448,0.004695787,0.0001356062,0.000161017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9176597,0.00005776244,0.06219974,0.01051412,0.003206721,0.0003565095,0.000004617542,0.0001062481,0.005894591],"genre_scores_gemma":[0.9973789,0.00001165245,0.002157463,0.0001396288,0.0001987054,0.000006226962,0.000001775718,0.00001440822,0.00009117106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6510957,"threshold_uncertainty_score":0.5562614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03583909945246017,"score_gpt":0.2930853702677197,"score_spread":0.2572462708152596,"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."}}