{"id":"W50198451","doi":"","title":"Declarative programming of search problems with built-in arithmetic","year":2009,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Arithmetic function; Natural number; Programming language; Class (philosophy); Declarative programming; Extension (predicate logic); Theoretical computer science; Aggregate (composite); Domain (mathematical analysis); Set (abstract data type); Expressive power; Finite set; Arithmetic; Mathematics; Programming paradigm; Discrete mathematics; Inductive programming; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003108359,0.00009998077,0.0001632305,0.0001132219,0.0000379494,0.00006971065,0.0004930435,0.0000390852,0.000008768254],"category_scores_gemma":[0.00001951495,0.00006519267,0.00002751888,0.0006763957,0.00005247836,0.0002338304,0.00007027279,0.0001188359,0.00001215054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000260821,"about_ca_system_score_gemma":0.0001002668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007506042,"about_ca_topic_score_gemma":0.0002645903,"domain_scores_codex":[0.9990038,0.00005055426,0.0001572332,0.0002757906,0.0002188264,0.0002938336],"domain_scores_gemma":[0.9994439,0.00004636382,0.00004120251,0.0002873905,0.0001167151,0.00006435694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000249992,0.000986559,0.02768444,0.0000652102,0.0000264135,0.00006569866,0.01367623,0.0005453628,0.001294953,0.4774215,0.0001339318,0.4780747],"study_design_scores_gemma":[0.009286691,0.01750456,0.3743543,0.001156264,0.00004668971,0.0003548846,0.002366635,0.3703991,0.1187572,0.09415405,0.008738543,0.002881037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1361404,0.0002985139,0.7958956,0.0005491553,0.00004193911,0.0006528021,1.952277e-7,0.0001713566,0.06625006],"genre_scores_gemma":[0.8809758,0.000003731699,0.1184155,0.00004277936,0.00001078661,0.0000094965,3.423225e-7,0.000002779836,0.0005387097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7448355,"threshold_uncertainty_score":0.265848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02494960034182931,"score_gpt":0.2678502171375854,"score_spread":0.2429006167957561,"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."}}