{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000130246,0.000122493,0.0001189677,0.00004747651,0.0001651361,0.0001994944,0.0007421906,0.00006426758,0.0008062714],"category_scores_gemma":[0.00004580958,0.00008737154,0.00005857637,0.0005360282,0.00004476813,0.0002856464,0.0002056004,0.00008905423,0.00215862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002212348,"about_ca_system_score_gemma":0.00001267452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003256015,"about_ca_topic_score_gemma":0.00004363066,"domain_scores_codex":[0.9989324,0.00002272921,0.0001324582,0.0003960177,0.0001596448,0.0003567337],"domain_scores_gemma":[0.9991766,0.00003034864,0.00003660483,0.0005590522,0.0000877297,0.0001097243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001331052,0.0006351452,0.00237713,0.00002395946,0.00002094335,0.00003983661,0.002125082,0.00003632565,0.00003611851,0.7812855,0.06960113,0.1438175],"study_design_scores_gemma":[0.0008267867,0.0005545138,0.001377975,0.00003437689,0.00001044718,0.0001167379,0.00007931021,0.3758009,0.0005809494,0.04234684,0.5774937,0.000777443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001331412,0.0007801836,0.2821596,0.002783668,0.0005537632,0.0002216777,1.111982e-7,0.0007844103,0.7113851],"genre_scores_gemma":[0.780892,0.0000942718,0.1379219,0.0007295934,0.0001923086,0.00004570954,0.000001149094,0.00001166152,0.08011143],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7795605,"threshold_uncertainty_score":0.9986183,"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."}}