{"id":"W3118093767","doi":"10.1093/logcom/exaa079","title":"Parameterized complexity of abduction in Schaefer’s framework","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Computer science; Dimension (graph theory); Artificial intelligence; Kernelization; Set (abstract data type); Satisfiability; Theoretical computer science; Mathematics; Mathematical economics; Algorithm; Combinatorics; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009313096,0.0009769645,0.001842889,0.002541602,0.001452356,0.006821302,0.003155539,0.002234176,0.006122053],"category_scores_gemma":[0.05084435,0.001138076,0.004052565,0.003583272,0.004835843,0.01476987,0.00537475,0.004614362,0.0003884049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008173858,"about_ca_system_score_gemma":0.003413441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0076673,"about_ca_topic_score_gemma":0.005477345,"domain_scores_codex":[0.9853824,0.005255552,0.00118128,0.00237621,0.004674824,0.001129675],"domain_scores_gemma":[0.9353737,0.05225349,0.002558381,0.006532725,0.002374912,0.0009067581],"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.0002214921,0.00009602238,0.002214037,0.0002712586,0.0001607428,0.0003092226,0.0008329134,0.1623798,0.001508174,0.7959473,0.002098533,0.0339605],"study_design_scores_gemma":[0.00003999944,0.00002461814,0.0005413889,0.00003917136,0.00005826549,0.00009649031,0.0001088098,0.2063458,0.0007312076,0.7896053,0.0023734,0.00003560767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1954078,0.002467152,0.775952,0.005550595,0.00006383866,0.0002941247,0.001208714,0.0008897491,0.01816604],"genre_scores_gemma":[0.7885288,0.001247112,0.2040223,0.0003647041,0.0001839396,0.0003991949,0.001255561,0.000243962,0.003754491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009313096,"threshold_uncertainty_score":0.05930573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08801501108235356,"score_gpt":0.3011803870368022,"score_spread":0.2131653759544487,"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."}}