{"id":"W4281633131","doi":"10.1613/jair.1.12670","title":"Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Maximum satisfiability problem; Computer science; Answer set programming; Constraint programming; Scheduling (production processes); Mathematical optimization; Satisfiability; Job shop scheduling; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Schedule; Stochastic programming; Programming language","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":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06261413,0.0001799574,0.000427651,0.001907493,0.00293006,0.001303107,0.002891909,0.00006035883,0.0004288559],"category_scores_gemma":[0.03763761,0.0001197959,0.000193602,0.01213297,0.0002889537,0.0003370847,0.001164584,0.001611007,0.000422069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002666551,"about_ca_system_score_gemma":0.001423299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001864975,"about_ca_topic_score_gemma":0.00009266419,"domain_scores_codex":[0.989522,0.001579821,0.001858452,0.000544825,0.005513966,0.000980873],"domain_scores_gemma":[0.988436,0.004505278,0.0005419374,0.0007164681,0.005336097,0.0004642165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","study_design_scores_codex":[0.0001694066,0.0001992435,0.0004252985,0.000007101578,0.0000345171,0.0000352683,0.004274284,0.8372577,0.003374642,0.01183963,0.001129981,0.1412529],"study_design_scores_gemma":[0.0002090451,0.001284783,0.003398744,0.0006587125,0.00009060104,0.001052272,0.3358933,0.2877712,0.01434172,0.2945462,0.05958728,0.001166226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4074819,0.0005657808,0.4798175,0.1077003,0.001687713,0.0007821784,0.00001495765,0.00003380581,0.001915855],"genre_scores_gemma":[0.9547358,0.00001309619,0.04393078,0.0001819373,0.0008500713,0.00004206127,6.510776e-7,0.00002276444,0.0002228095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5494866,"threshold_uncertainty_score":0.9997336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.6624061415240893,"score_gpt":0.4778005935785792,"score_spread":0.18460554794551,"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."}}