{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003060907,0.0006107733,0.0006210489,0.0006399967,0.000625153,0.003346424,0.002592341,0.0009159048,0.003757184],"category_scores_gemma":[0.005465707,0.0005892492,0.001551618,0.0009222461,0.003305857,0.006455989,0.002688308,0.002923548,0.0003773342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587675,"about_ca_system_score_gemma":0.001386104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001929475,"about_ca_topic_score_gemma":0.003688431,"domain_scores_codex":[0.9984362,0.0006098251,0.0001503177,0.0002403429,0.0003934848,0.0001698157],"domain_scores_gemma":[0.9965464,0.002566066,0.0002388097,0.00033661,0.0001922125,0.0001199179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004714194,0.00004991548,0.0003137722,0.0001330855,0.00002648462,0.0001106292,0.0003461012,0.05167482,0.001470785,0.9326215,0.001136769,0.01206889],"study_design_scores_gemma":[0.0000481464,0.00004328271,0.0001004904,0.00006145849,0.00003967128,0.000115478,0.000151767,0.2911141,0.003102874,0.6976393,0.0075644,0.00001906108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02548004,0.0001945337,0.966275,0.00100027,0.00004935399,0.00009514864,0.000184715,0.0006980113,0.006022995],"genre_scores_gemma":[0.4593513,0.0003855534,0.5343184,0.0003655882,0.0001073737,0.0002838773,0.0004560264,0.0001596228,0.004572301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003757184,"threshold_uncertainty_score":0.01618785,"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."}}