{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008707332,0.0001916885,0.0001643572,0.0002867994,0.0004341365,0.0006006909,0.0006261205,0.00006225549,0.00005683559],"category_scores_gemma":[0.0003131311,0.0001442172,0.00004604079,0.003196668,0.00004095836,0.0004520924,0.0003884766,0.0001455587,0.0004384541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004997381,"about_ca_system_score_gemma":0.0001858385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008021308,"about_ca_topic_score_gemma":0.000130282,"domain_scores_codex":[0.9982771,0.00003811495,0.0003660574,0.0005223575,0.0003572656,0.0004390635],"domain_scores_gemma":[0.9988891,0.0001450784,0.0000945778,0.0004501627,0.00026541,0.0001556321],"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.000005740043,0.00003202209,0.0008079251,0.0000499496,0.00002568939,0.00001208817,0.002267325,0.6765337,0.001395193,0.05205639,0.0009455655,0.2658684],"study_design_scores_gemma":[0.0004166236,0.00002144316,0.2284369,0.0002283168,0.00001320991,0.00006032786,0.002311056,0.7625731,0.0006594082,0.001472446,0.003101992,0.0007052402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01206915,0.000007619931,0.930224,0.04236037,0.0004309343,0.0005875495,0.000001993352,0.0008927624,0.01342562],"genre_scores_gemma":[0.7324719,0.000005634161,0.2663095,0.0007825074,0.00009735155,0.0000567585,0.000006102614,0.00001472966,0.0002555349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7204027,"threshold_uncertainty_score":0.5881006,"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."}}