{"id":"W1537351989","doi":"10.1007/3-540-45153-6_8","title":"Constraint Programming Lessons Learned from Crossword Puzzles","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Constraint programming; Constraint logic programming; Constraint (computer-aided design); Heuristic; Constraint satisfaction; Independence (probability theory); Mathematical optimization; Concurrent constraint logic programming; Theoretical computer science; Artificial intelligence; Mathematics; Stochastic programming","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005404146,0.0005509113,0.0005128988,0.0006667777,0.0004103151,0.001887547,0.00206709,0.000390532,0.0001223344],"category_scores_gemma":[0.0001362974,0.000539877,0.0001648019,0.0006432376,0.001280131,0.0007920917,0.0008102488,0.0008876547,0.00004680063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003065013,"about_ca_system_score_gemma":0.0007288714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005876953,"about_ca_topic_score_gemma":0.0004258047,"domain_scores_codex":[0.996145,0.0000433258,0.0004712141,0.001751663,0.000890329,0.0006985392],"domain_scores_gemma":[0.9975073,0.0004471911,0.0003549263,0.001188261,0.0002669979,0.0002353076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002784487,0.00001533608,0.00008267676,0.000006949935,0.00001143085,0.00008047019,0.0004022573,0.01109951,0.00005829877,0.02470151,0.00001202754,0.9635267],"study_design_scores_gemma":[0.0008647745,0.000151115,0.0004920442,0.0006795152,0.00002472204,0.0002025499,0.000002569423,0.649915,0.0007784289,0.3061051,0.03897766,0.001806514],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004043177,0.0002035177,0.9837216,0.009234858,0.001514517,0.0003937678,0.0000136602,0.0003643529,0.004513347],"genre_scores_gemma":[0.1362727,0.0002157442,0.8607463,0.001274143,0.0005415503,0.00001652249,0.00003071269,0.00004838706,0.0008538821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9617202,"threshold_uncertainty_score":0.9997053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04186782154946445,"score_gpt":0.2843121943162207,"score_spread":0.2424443727667562,"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."}}