{"id":"W1583108239","doi":"10.1007/11562931_18","title":"Reducing Inductive Definitions to Propositional Satisfiability","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Propositional calculus; Satisfiability; Answer set programming; Reduction (mathematics); Programming language; Theoretical computer science; Well-formed formula; Semantics (computer science); Boolean satisfiability problem; Logic programming; Extension (predicate logic); Inductive logic programming; Class (philosophy); Knowledge representation and reasoning; Intermediate logic; Propositional variable; Mathematics; Description logic; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008297798,0.0005035268,0.0004741774,0.0007517856,0.000487154,0.0005107488,0.002499748,0.000308944,0.00007241375],"category_scores_gemma":[0.0002465767,0.0004577817,0.0001495064,0.0008019942,0.0006742398,0.0007010093,0.001450349,0.0008748698,0.0002246462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007574903,"about_ca_system_score_gemma":0.001081382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003879981,"about_ca_topic_score_gemma":0.0001429838,"domain_scores_codex":[0.9959535,0.00005477035,0.0005047872,0.001881967,0.0009040247,0.0007009616],"domain_scores_gemma":[0.9972843,0.0004592839,0.000203968,0.001278854,0.0004665402,0.0003070798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005629995,0.00008873059,0.00009650408,0.00002489409,0.00001404084,0.00003823378,0.002698082,0.01296054,0.0001931516,0.3462625,0.00009796222,0.6375197],"study_design_scores_gemma":[0.000347713,0.0004658132,0.002030945,0.0006490061,0.00001754217,0.0002146575,5.633447e-7,0.08259662,0.002017968,0.906758,0.003382424,0.001518726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003114533,0.000162377,0.9647293,0.001697294,0.001406777,0.0005587757,0.00001220577,0.0001965107,0.03092531],"genre_scores_gemma":[0.268795,0.00001496046,0.7280554,0.00153909,0.001142153,0.00003421011,0.000008266175,0.00002774264,0.0003831949],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.636001,"threshold_uncertainty_score":0.9997874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02971535804957404,"score_gpt":0.2555019588503248,"score_spread":0.2257866008007507,"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."}}