{"id":"W2524435840","doi":"","title":"Generating propagation rules for finite domains : A mixed approach","year":2000,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Constraint satisfaction problem; Unification; Constraint logic programming; Local consistency; Computer science; Constraint programming; Constraint satisfaction; Constraint (computer-aided design); Solver; Domain (mathematical analysis); Mathematical optimization; Concurrent constraint logic programming; Algorithm; Theoretical computer science; Binary constraint; Programming language; Artificial intelligence; Mathematics","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.002690694,0.0001950006,0.0001855834,0.0001175603,0.000346983,0.0003442582,0.001149288,0.000102543,0.0000219646],"category_scores_gemma":[0.0001881682,0.0002038175,0.0001078809,0.0003597281,0.00006389579,0.0003910982,0.0001957154,0.0001557549,0.00001778319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006603591,"about_ca_system_score_gemma":0.00007904957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006244563,"about_ca_topic_score_gemma":0.00004077398,"domain_scores_codex":[0.9975203,0.001017333,0.00033521,0.000544869,0.0002706039,0.0003117199],"domain_scores_gemma":[0.9971927,0.0005581592,0.0001373422,0.001322159,0.0006828358,0.000106776],"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.000003592681,0.0002095099,0.00006808442,0.00005073645,0.00001765798,9.23516e-7,0.003679764,0.002697405,0.002696854,0.4894552,0.0005227853,0.5005975],"study_design_scores_gemma":[0.0003102262,7.229072e-7,0.0002122132,0.000151589,0.000006942432,0.000007727639,0.00000492061,0.9386207,0.02664365,0.002597125,0.03118794,0.0002562477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02153374,0.0001103946,0.9717741,0.001173927,0.00004756524,0.0004858023,0.00001363198,0.0009492665,0.003911554],"genre_scores_gemma":[0.1283416,0.00003793089,0.8689769,0.00006280343,0.00001877654,0.0002265114,0.0001125001,0.00002496592,0.002198052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9359233,"threshold_uncertainty_score":0.8311438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0126391017508608,"score_gpt":0.2099100781631635,"score_spread":0.1972709764123027,"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."}}