{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00408326,0.001039321,0.00115034,0.002484124,0.001993303,0.005018232,0.005503363,0.00173297,0.009748966],"category_scores_gemma":[0.02249814,0.001791872,0.003085448,0.003075038,0.006762144,0.01269822,0.01035846,0.01191372,0.002245436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717447,"about_ca_system_score_gemma":0.001382656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002020795,"about_ca_topic_score_gemma":0.002545365,"domain_scores_codex":[0.9946727,0.002259081,0.0003636744,0.0005644161,0.001604622,0.0005354382],"domain_scores_gemma":[0.9849827,0.01157766,0.0003388528,0.00154125,0.001341589,0.0002178649],"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.00002579143,0.00005498431,0.0001574336,0.0001495183,0.00002223142,0.0001097486,0.0006949204,0.002216477,0.0005075961,0.9599374,0.006396519,0.02972747],"study_design_scores_gemma":[0.00001193871,0.000006520123,0.00005207945,0.00003833526,0.00001819035,0.00004679774,0.0001426533,0.005450592,0.0008387772,0.9835687,0.009815329,0.00001000222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01555337,0.00155255,0.9149511,0.0037033,0.0007176394,0.0001205471,0.000267698,0.001001035,0.06213274],"genre_scores_gemma":[0.3606683,0.003495992,0.5941016,0.002947356,0.001772116,0.0006177905,0.002132517,0.001643796,0.03262055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009748966,"threshold_uncertainty_score":0.03261352,"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."}}