{"id":"W1891844195","doi":"10.1109/pacrim.1993.407253","title":"Solving logic problems with object-oriented constraint logic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint logic programming; Concurrent constraint logic programming; Logic programming; Constraint programming; Computer science; Constraint satisfaction; Programming language; Constraint satisfaction problem; Theoretical computer science; Consistency (knowledge bases); Constraint (computer-aided design); Computational logic; Local consistency; Functional logic programming; Object (grammar); Inductive programming; Programming paradigm; Description logic; Mathematics; Artificial intelligence; Mathematical optimization","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.003011898,0.001164583,0.0007373604,0.001661593,0.001236954,0.004781138,0.002508862,0.001617967,0.005933836],"category_scores_gemma":[0.006978488,0.0007417744,0.001694498,0.0031263,0.002338424,0.004512656,0.002561993,0.002349917,0.001131578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001630939,"about_ca_system_score_gemma":0.002485142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004666042,"about_ca_topic_score_gemma":0.006196427,"domain_scores_codex":[0.9976944,0.0007768099,0.0001886138,0.000270201,0.0008715769,0.0001983675],"domain_scores_gemma":[0.9968728,0.002135376,0.0002288574,0.0002939179,0.0003738824,0.00009512887],"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.00005541229,0.0001397565,0.0004367252,0.0004803052,0.00008957085,0.0002385774,0.0003406067,0.08184131,0.001076599,0.7601788,0.009144202,0.1459781],"study_design_scores_gemma":[0.00009151222,0.00004025039,0.0001040975,0.0001537252,0.00005512021,0.0001868809,0.0002167711,0.2308025,0.002991333,0.6836286,0.08168682,0.0000423928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001767108,0.0005566804,0.9838139,0.00104,0.0000955104,0.0001422437,0.0000801452,0.0002875743,0.01221689],"genre_scores_gemma":[0.03539462,0.00140479,0.9565144,0.0004874801,0.0001430023,0.0002650768,0.0002302098,0.0001113672,0.005449012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005933836,"threshold_uncertainty_score":0.01985073,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02398054239888595,"score_gpt":0.2216344161237775,"score_spread":0.1976538737248916,"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."}}