{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480371,0.001259932,0.001084193,0.001766107,0.0007567021,0.001758731,0.001602773,0.001002934,0.004798199],"category_scores_gemma":[0.006338015,0.0008673501,0.00235562,0.001533819,0.001398752,0.0031327,0.001754716,0.001745284,0.00110249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321671,"about_ca_system_score_gemma":0.001908408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004360572,"about_ca_topic_score_gemma":0.008596272,"domain_scores_codex":[0.9980608,0.0007300233,0.0001723202,0.0002622592,0.0005793431,0.0001953713],"domain_scores_gemma":[0.9969597,0.002245103,0.0001525023,0.0002871059,0.0003048791,0.00005078004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003764968,0.0002114181,0.002402326,0.0008583435,0.0002184208,0.000506766,0.0004781558,0.4989098,0.01913373,0.2121418,0.005907574,0.2588552],"study_design_scores_gemma":[0.00004854683,0.00004914617,0.0002051612,0.00005489431,0.00004630366,0.0000877299,0.00008184028,0.8935536,0.0106253,0.09098275,0.004242685,0.00002205053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01908692,0.0001391165,0.9747123,0.0001545883,0.00002296418,0.0001934063,0.0004076899,0.002226565,0.00305638],"genre_scores_gemma":[0.2026954,0.0001986846,0.7928107,0.000145846,0.00001800178,0.0002762363,0.001651914,0.0004101452,0.001792984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004798199,"threshold_uncertainty_score":0.01605159,"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."}}