{"id":"W4385764173","doi":"10.24963/ijcai.2023/768","title":"Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract)","year":2023,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Ministerio de Ciencia e Innovación","keywords":"Maximum satisfiability problem; Computer science; Mathematical optimization; Integer programming; Scheduling (production processes); Constraint programming; Answer set programming; Satisfiability; Job shop scheduling; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Schedule; Stochastic programming; Programming language","routes":{"ca_aff":true,"ca_fund":false,"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.001362578,0.00114008,0.0005160696,0.0009345738,0.0007536914,0.002062783,0.001597442,0.001009499,0.01198577],"category_scores_gemma":[0.003799656,0.0004619177,0.001089724,0.003333154,0.0007189363,0.001571557,0.001199803,0.001968645,0.001239704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001224498,"about_ca_system_score_gemma":0.002242598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009152127,"about_ca_topic_score_gemma":0.009846471,"domain_scores_codex":[0.9988554,0.0005449236,0.00006607786,0.0001743256,0.0002478767,0.0001113566],"domain_scores_gemma":[0.9982576,0.001266045,0.0001130775,0.0001196049,0.0001806123,0.00006301804],"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.0002170388,0.0002352951,0.0004771095,0.0008934726,0.0001047762,0.0003062238,0.0002083507,0.6664034,0.003545593,0.1285108,0.01589744,0.1832005],"study_design_scores_gemma":[0.0000844396,0.00008163976,0.0002590059,0.0001011849,0.00003072067,0.0001605723,0.00012235,0.9116378,0.003127151,0.06124692,0.02312587,0.00002229633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0116939,0.001082168,0.9698831,0.001044202,0.0001205169,0.000321572,0.001104667,0.0004915261,0.01425833],"genre_scores_gemma":[0.09650376,0.001391738,0.8953256,0.0002913055,0.0001081022,0.0004934854,0.001514702,0.0002050953,0.004166252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198577,"threshold_uncertainty_score":0.0400964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.073421568515466,"score_gpt":0.2486889159361985,"score_spread":0.1752673474207325,"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."}}