{"id":"W2136410977","doi":"10.1109/icde.1991.131524","title":"First-order logic reducible programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Transitive closure; Assertion; Fixed point; Computer science; Arity; Logical consequence; Second-order logic; Closure (psychology); Constraint (computer-aided design); Data integrity; Discrete mathematics; Directed acyclic graph; Set (abstract data type); First-order logic; Theoretical computer science; Logic programming; Programming language; Independence (probability theory); Horn clause; Least fixed point; Mathematics; Algorithm; Higher-order logic; Fixed-point theorem; 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.001223509,0.0006234115,0.0006121484,0.001026853,0.000693094,0.002343314,0.001185096,0.000680352,0.003799239],"category_scores_gemma":[0.00457454,0.0003684358,0.001679614,0.0008605497,0.002119037,0.003276106,0.001204192,0.002942452,0.0004497802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001914703,"about_ca_system_score_gemma":0.00182872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966663,"about_ca_topic_score_gemma":0.002611455,"domain_scores_codex":[0.9985155,0.0003341568,0.00009717164,0.0003136413,0.0005292836,0.0002101946],"domain_scores_gemma":[0.9973804,0.001342016,0.0002612694,0.0005106399,0.0004187929,0.00008695274],"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.00004933395,0.0000525551,0.0002936319,0.000151207,0.00003874158,0.0002690709,0.0005611434,0.01565325,0.001648305,0.9594378,0.001873228,0.01997154],"study_design_scores_gemma":[0.00003436905,0.00004299287,0.0002103473,0.00005654126,0.0000741864,0.0002241329,0.0001624604,0.03976322,0.005580403,0.9291441,0.02468764,0.00001971816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0624422,0.0009000249,0.8592322,0.0009698264,0.0001277184,0.0003841824,0.0009018868,0.001685564,0.07335639],"genre_scores_gemma":[0.6542917,0.00131662,0.3096674,0.0005952534,0.0001905484,0.000629416,0.002429823,0.0005218276,0.03035747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003799239,"threshold_uncertainty_score":0.01389223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04528125853756291,"score_gpt":0.2394164794995449,"score_spread":0.194135220961982,"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."}}