{"id":"W19153916","doi":"10.1080/00048670802607154","title":"A framework for representing and solving NP search problems","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Answer set programming; Constraint programming; Parameterized complexity; Computer science; Constraint satisfaction; Extension (predicate logic); Satisfiability; Boolean satisfiability problem; Set (abstract data type); Theoretical computer science; Solver; Strengths and weaknesses; Backtracking; Constraint (computer-aided design); Mathematical optimization; Programming language; Mathematics; Artificial intelligence; Algorithm; Stochastic programming","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.0009645208,0.0001502718,0.0001524644,0.0001491809,0.0003555831,0.0004894396,0.0005948741,0.0001124307,0.00006720248],"category_scores_gemma":[0.001352691,0.0001412029,0.00005788861,0.0003037931,0.0001092156,0.0004107865,0.0001793735,0.0002613326,0.0001170001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006389032,"about_ca_system_score_gemma":0.0002094692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367171,"about_ca_topic_score_gemma":0.00004961733,"domain_scores_codex":[0.9981775,0.00006033606,0.0003325891,0.0005692844,0.0005023201,0.0003580163],"domain_scores_gemma":[0.9979953,0.0008015443,0.00009865077,0.0002296977,0.0007628423,0.0001119186],"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.000008458258,0.00006072026,0.00005900293,0.00001048513,0.000005858249,5.296998e-7,0.0009449069,0.0006875041,0.0005532519,0.8416809,0.00007571036,0.1559126],"study_design_scores_gemma":[0.00001965027,0.00006729896,0.0001080255,0.00004953081,0.000001661474,0.000004450539,0.00007024685,0.4523407,0.007587567,0.5384727,0.001132256,0.0001458974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245312,0.00009548604,0.9782361,0.004834598,0.0001975451,0.0003234149,0.000004053729,0.0001121786,0.01295132],"genre_scores_gemma":[0.9019688,0.0000263159,0.0969623,0.0003437997,0.0003441234,0.00005437749,0.000002777247,0.000007847427,0.0002896302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8987235,"threshold_uncertainty_score":0.5758089,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2083022900782457,"score_gpt":0.3866366578885083,"score_spread":0.1783343678102626,"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."}}