{"id":"W2778034045","doi":"10.1145/3158149","title":"Strategy synthesis for linear arithmetic games","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Combinatorial game theory; Satisfiability; Dimension (graph theory); Game tree; Game theory; Repeated game; Theoretical computer science; Sequential game; Mathematical economics; Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.001729252,0.001283112,0.0009512305,0.00095721,0.0008298308,0.002330077,0.001342463,0.001120339,0.008235074],"category_scores_gemma":[0.00675634,0.0006575051,0.002061475,0.0007015233,0.00272769,0.002822986,0.002109018,0.002296209,0.001195926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002458642,"about_ca_system_score_gemma":0.002034886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002385544,"about_ca_topic_score_gemma":0.003264326,"domain_scores_codex":[0.9975531,0.0007947676,0.0002149776,0.0005149186,0.0006151477,0.0003071548],"domain_scores_gemma":[0.9975951,0.001882178,0.0001292649,0.0001502023,0.0001674115,0.00007574927],"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.000162465,0.0001463836,0.0004509195,0.0005301014,0.00006658037,0.0001996595,0.0006599389,0.112936,0.006155251,0.8064868,0.001975705,0.07023017],"study_design_scores_gemma":[0.0001327246,0.0001185035,0.00009810898,0.00009783475,0.00005735889,0.000077508,0.0001822294,0.2506192,0.005858969,0.7337814,0.008943558,0.00003256135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02317699,0.0003355319,0.9556727,0.0005391752,0.00007491294,0.0003921906,0.0001744193,0.001049836,0.01858426],"genre_scores_gemma":[0.3499716,0.0004888733,0.6368597,0.0004183023,0.00006169312,0.0008463884,0.0005342734,0.0003297006,0.01048956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008235074,"threshold_uncertainty_score":0.02754903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04933114638016753,"score_gpt":0.3478667795385895,"score_spread":0.2985356331584219,"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."}}