{"id":"W1551913915","doi":"","title":"Game-SAT: A Preliminary Report.","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Boolean satisfiability problem; Variable (mathematics); Solver; Game tree; PSPACE; Pruning; Computer science; Search tree; Domain (mathematical analysis); Mathematics; Tree (set theory); Sequential game; Theoretical computer science; Algorithm; Computational complexity theory; Combinatorics; Mathematical optimization; Search algorithm; Game theory; 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.005963971,0.001398096,0.0008936002,0.002821936,0.001242346,0.003511251,0.002887149,0.001179387,0.05929852],"category_scores_gemma":[0.03069154,0.001266808,0.001315719,0.005428138,0.001065866,0.004547121,0.002257225,0.003187611,0.0146193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002498287,"about_ca_system_score_gemma":0.00312541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01534697,"about_ca_topic_score_gemma":0.01692058,"domain_scores_codex":[0.9965282,0.001383192,0.000304517,0.0004529014,0.001073492,0.0002577879],"domain_scores_gemma":[0.9785846,0.01404489,0.0005056995,0.002868327,0.003240836,0.0007557228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007883896,0.001086872,0.008292316,0.001362636,0.0002800635,0.0002637056,0.0006451992,0.03472346,0.001466654,0.09700085,0.5378533,0.3162365],"study_design_scores_gemma":[0.0005469814,0.0004556848,0.01077021,0.0005389436,0.0002682405,0.0006582096,0.0004709118,0.1588733,0.005642619,0.1250839,0.6965811,0.0001098124],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05037287,0.0128227,0.4986553,0.01292264,0.002961162,0.002641662,0.1023262,0.03279384,0.2845037],"genre_scores_gemma":[0.322443,0.009291708,0.3786411,0.002774611,0.001029012,0.003693119,0.1976884,0.006169875,0.07826915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05929852,"threshold_uncertainty_score":0.1983733,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01195437496025022,"score_gpt":0.231835812840935,"score_spread":0.2198814378806847,"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."}}