{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591361,0.001373223,0.0007950739,0.001369271,0.0008758732,0.002900648,0.003141263,0.001235058,0.008166887],"category_scores_gemma":[0.01111684,0.0007669923,0.001820517,0.003676299,0.001363922,0.003987367,0.002334328,0.003539172,0.001513057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002465815,"about_ca_system_score_gemma":0.008546104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01975836,"about_ca_topic_score_gemma":0.03148992,"domain_scores_codex":[0.9974618,0.0009342637,0.0001476849,0.0005078402,0.0007520232,0.0001964689],"domain_scores_gemma":[0.9935057,0.004272672,0.0004503921,0.001132944,0.000467063,0.000171115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001484218,0.0002599224,0.001039124,0.0007097701,0.0001469336,0.0001038472,0.0002345175,0.6472808,0.001745261,0.1549074,0.01090434,0.1825197],"study_design_scores_gemma":[0.00004942202,0.00005161287,0.0001625014,0.00005466706,0.00003635511,0.00004508654,0.00005840768,0.9266542,0.001144692,0.06283765,0.008890815,0.00001457036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01075597,0.0007440346,0.9676729,0.0007817079,0.00006538928,0.0003891698,0.0007558159,0.001560757,0.01727427],"genre_scores_gemma":[0.1601293,0.001036473,0.8328385,0.0002867228,0.00004734394,0.0007405913,0.001389493,0.0003291487,0.003202518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01975836,"threshold_uncertainty_score":0.03928667,"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."}}