{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005978151,0.001168604,0.001332615,0.001963099,0.001789128,0.004468316,0.003118919,0.001968593,0.005039737],"category_scores_gemma":[0.02184421,0.001101505,0.004243344,0.002452202,0.003755896,0.00764404,0.005563949,0.003456502,0.0009668318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003003826,"about_ca_system_score_gemma":0.004250946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008148252,"about_ca_topic_score_gemma":0.01206907,"domain_scores_codex":[0.9927164,0.002257395,0.0005899561,0.001308081,0.00248422,0.0006440747],"domain_scores_gemma":[0.9859807,0.01083827,0.0008811182,0.001249092,0.0007588419,0.0002919501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003629062,0.0002207243,0.002436611,0.0008016814,0.0002075945,0.0011244,0.001150788,0.3597584,0.01130036,0.5041411,0.007534397,0.110961],"study_design_scores_gemma":[0.00006557319,0.00004044643,0.0002026229,0.00007360677,0.00007668769,0.0002130835,0.00021244,0.6205233,0.013661,0.3556287,0.009258819,0.00004378088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01531927,0.0001303251,0.9787433,0.000600621,0.00006066754,0.000115436,0.0002852759,0.001913901,0.002831177],"genre_scores_gemma":[0.1964819,0.000227336,0.7992312,0.0003632135,0.0001066233,0.0002338815,0.0009282416,0.0004312165,0.001996357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008148252,"threshold_uncertainty_score":0.03161585,"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."}}