{"id":"W3006499216","doi":"10.1109/ictai.2019.00062","title":"A Divide and Conquer Algorithm for Dominance Testing in Acyclic CP-Nets","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Divide and conquer algorithms; Computer science; Dominance (genetics); Ceteris paribus; Preference; Net (polyhedron); Algorithm; Theoretical computer science; Mathematics; Statistics","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.001575945,0.001408334,0.001122281,0.001670035,0.001193056,0.001379063,0.001864776,0.00114298,0.007395533],"category_scores_gemma":[0.004809869,0.0006452737,0.0009135964,0.001925319,0.0009146176,0.002284266,0.001939953,0.002009178,0.0009097323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001593543,"about_ca_system_score_gemma":0.003893802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01184467,"about_ca_topic_score_gemma":0.01451573,"domain_scores_codex":[0.9985253,0.0003283406,0.0001163016,0.0003499067,0.0004230379,0.0002570957],"domain_scores_gemma":[0.9977778,0.001316874,0.0001591312,0.0001829959,0.0004502123,0.0001129582],"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.0004187856,0.0003605121,0.00136724,0.0003175488,0.00008427971,0.0001875628,0.00019881,0.2026031,0.006542396,0.04099974,0.00955838,0.7373617],"study_design_scores_gemma":[0.0001317983,0.00007884071,0.0001572109,0.00002125744,0.0000242415,0.00007540997,0.00007555683,0.9628827,0.002795532,0.0310544,0.002685378,0.00001767448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008599394,0.0001348402,0.9870955,0.0001893962,0.00002322069,0.0002268052,0.00014852,0.001130912,0.002451359],"genre_scores_gemma":[0.07748967,0.00008137072,0.9195626,0.000100028,0.00002449148,0.0002492246,0.0004986889,0.0001635811,0.001830263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01184467,"threshold_uncertainty_score":0.02474052,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01346909831196018,"score_gpt":0.237207959619433,"score_spread":0.2237388613074728,"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."}}