{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068055,0.001359659,0.0006500705,0.001095657,0.0007843994,0.0021432,0.002174181,0.001137092,0.007584602],"category_scores_gemma":[0.006167455,0.0006296071,0.001314997,0.00354915,0.0008684584,0.002160177,0.001204998,0.002633024,0.0007724598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001600077,"about_ca_system_score_gemma":0.00330767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006999794,"about_ca_topic_score_gemma":0.007905425,"domain_scores_codex":[0.9981281,0.0009076811,0.0001062055,0.0003018878,0.000406105,0.000149991],"domain_scores_gemma":[0.9967056,0.002584832,0.0001803028,0.0001913929,0.0002558783,0.00008204526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001566659,0.0002262978,0.0004184381,0.001005603,0.0001173013,0.0001934114,0.0002285237,0.6432159,0.002457579,0.1791398,0.007798849,0.1650416],"study_design_scores_gemma":[0.00009695283,0.0001027611,0.0002317879,0.0001340702,0.0000529793,0.0001734089,0.0001688694,0.8561218,0.002886869,0.1156777,0.02432509,0.00002772167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007438399,0.0008817066,0.9800348,0.000933059,0.0000714477,0.0002963445,0.0005748816,0.000297556,0.009471743],"genre_scores_gemma":[0.06724808,0.001673707,0.9269895,0.0002333905,0.00009487459,0.0004001145,0.0008103396,0.0001330678,0.002416919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007584602,"threshold_uncertainty_score":0.02537304,"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."}}