{"id":"W1559927413","doi":"","title":"Detecting Backdoor Sets with Respect to Horn and Binary Clauses.","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Backdoor; Parameterized complexity; Satisfiability; Mathematics; Class (philosophy); Set (abstract data type); Binary number; Discrete mathematics; Combinatorics; Boolean satisfiability problem; French horn; Computer science; Artificial intelligence; Arithmetic; Physics","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.006381895,0.001425544,0.002367037,0.001638536,0.001832783,0.006286812,0.004481759,0.003217599,0.005175014],"category_scores_gemma":[0.06035684,0.001788427,0.003369618,0.002317556,0.003672008,0.01628895,0.004338378,0.00444183,0.0004449666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004516489,"about_ca_system_score_gemma":0.003856977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006057562,"about_ca_topic_score_gemma":0.005403083,"domain_scores_codex":[0.9878974,0.003399432,0.0008257879,0.002512941,0.003165949,0.002198505],"domain_scores_gemma":[0.8878602,0.09039079,0.009999744,0.008330133,0.002021708,0.00139738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.007241444,0.001874749,0.03249217,0.001886966,0.001940734,0.002298853,0.001448285,0.5837322,0.0447171,0.1454245,0.01198503,0.1649579],"study_design_scores_gemma":[0.000406403,0.0003768829,0.002519731,0.00007198542,0.0003262303,0.0007520235,0.0003992266,0.7921004,0.02500717,0.1762365,0.001720677,0.00008281491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.664178,0.0008813881,0.3192814,0.003013453,0.000122139,0.0009038863,0.002315026,0.003562945,0.005741721],"genre_scores_gemma":[0.9038387,0.0002256242,0.09154609,0.0004197217,0.00007914704,0.0002198127,0.001918153,0.000272488,0.001480168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006381895,"threshold_uncertainty_score":0.03375113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02499197815101134,"score_gpt":0.3024142130318423,"score_spread":0.277422234880831,"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."}}