{"id":"W2796695740","doi":"10.23638/lmcs-14(4:12)2018","title":"Reasoning with Finite Sets and Cardinality Constraints in SMT","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Cardinality (data modeling); Computer science; Venn diagram; Theoretical computer science; Satisfiability; DPLL algorithm; Automated reasoning; Boolean satisfiability problem; Intersection (aeronautics); Answer set programming; Satisfiability modulo theories; Propositional calculus; Modular design; Algorithm; Mathematics; Programming language; Logic programming; Data mining","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.01728413,0.0004569063,0.0007746341,0.0006181016,0.0001915596,0.0007348629,0.003485517,0.0003560489,0.000006488408],"category_scores_gemma":[0.001551803,0.0003687971,0.00006709967,0.002096783,0.003386541,0.000737913,0.005877026,0.001331951,0.000004392015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002806762,"about_ca_system_score_gemma":0.0004540589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006978351,"about_ca_topic_score_gemma":0.000009249893,"domain_scores_codex":[0.9930615,0.002172631,0.0007654615,0.002370804,0.0007860521,0.0008435405],"domain_scores_gemma":[0.9961041,0.001229458,0.0003945238,0.001732053,0.0002674068,0.0002724502],"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.00002319771,0.000098218,0.01319168,0.0001021095,0.000008347682,0.00009950971,0.001454605,0.005984161,0.0001069905,0.04051732,0.000003948996,0.9384099],"study_design_scores_gemma":[0.000277155,0.0002414524,0.1509098,0.0004783572,0.000004378461,0.00009261349,0.000009319635,0.7855839,0.0006390175,0.06121155,0.00004475563,0.0005077809],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03859809,0.0001110626,0.9580728,0.0001509088,0.001321454,0.0005103347,0.000003441644,0.0001426487,0.001089293],"genre_scores_gemma":[0.1128612,0.00002129906,0.8866792,0.0002886102,0.00008230814,0.00005429127,0.000001017458,0.000009725367,0.000002323001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9379022,"threshold_uncertainty_score":0.9998764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1017787013046702,"score_gpt":0.4146159754084892,"score_spread":0.3128372741038189,"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."}}