{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001652285,0.00004953823,0.0001552211,0.00008851435,0.00002258539,0.00002941898,0.000082928,0.00003807912,0.000008332637],"category_scores_gemma":[0.0000875624,0.00004365878,0.00003346175,0.0002476443,0.00005058702,0.0002814896,0.00002489156,0.0001228877,7.717269e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357655,"about_ca_system_score_gemma":0.0000306182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002917125,"about_ca_topic_score_gemma":5.792722e-7,"domain_scores_codex":[0.9993266,0.00007191201,0.0003357598,0.00008088051,0.000133245,0.00005161126],"domain_scores_gemma":[0.9994208,0.0000662625,0.0003207368,0.00003460053,0.0001101525,0.00004746265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003426452,0.0002279603,0.01777758,0.0001324713,0.00006577028,0.00003966761,0.00880076,0.2285163,0.005171176,0.3313247,0.000205177,0.4073958],"study_design_scores_gemma":[0.0009661217,0.000484422,0.07554845,0.00006746848,0.000009081846,0.00007650491,0.0002764236,0.7536958,0.0002911547,0.1684419,0.00003501643,0.0001076345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1706652,0.0000475866,0.8257924,0.003286961,0.0001068575,0.00004106545,2.225544e-7,0.000008775747,0.00005090598],"genre_scores_gemma":[0.7891191,0.00003629966,0.2105717,0.0002419393,0.00002886162,1.358321e-7,4.330692e-7,0.000001153848,4.096253e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6184539,"threshold_uncertainty_score":0.1780353,"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."}}