{"id":"W148231196","doi":"10.1609/aaai.v29i1.9752","title":"SAT-Based Strategy Extraction in Reachability Games","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Australian Government; Australian Research Council; Intel Corporation","keywords":"Reachability; Computer science; Counterexample; Formalism (music); Game tree; Sequential game; Tree traversal; Combinatorial game theory; Theoretical computer science; Tree (set theory); Game theory; Algorithm; Mathematics; Mathematical economics","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.00129724,0.0001874847,0.0002467576,0.0001336593,0.0000717519,0.000249695,0.001316029,0.0001124773,0.00001461018],"category_scores_gemma":[0.000515187,0.0001365808,0.00008626605,0.0006526572,0.0002002137,0.0004633704,0.0001432984,0.0002901759,0.00008377131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000103618,"about_ca_system_score_gemma":0.0002468551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004546915,"about_ca_topic_score_gemma":0.0001312515,"domain_scores_codex":[0.9981128,0.0000434095,0.0005410503,0.000482688,0.0004995217,0.0003205251],"domain_scores_gemma":[0.9985409,0.00007781358,0.0003434349,0.0003326178,0.0005922895,0.0001129187],"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.0000532144,0.000242118,0.002416676,0.0000350366,0.000003942918,8.881905e-7,0.001004155,0.000158866,0.004682005,0.885621,0.00006876592,0.1057134],"study_design_scores_gemma":[0.00008431696,0.0005426717,0.001675789,0.00006405611,0.00000694325,0.000006355124,0.001582316,0.08885892,0.2324529,0.6738954,0.0005093791,0.0003209695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.636902,0.0001652397,0.2618593,0.006850662,0.00263721,0.002235256,0.000003498506,0.0005404724,0.08880639],"genre_scores_gemma":[0.9986452,0.000003578947,0.001028194,0.00006735446,0.00005509328,0.00003416223,4.663136e-7,0.000007235636,0.00015873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3617432,"threshold_uncertainty_score":0.5569603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1476094504647622,"score_gpt":0.3297695599654198,"score_spread":0.1821601095006576,"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."}}