{"id":"W2058792175","doi":"10.1016/j.artint.2005.09.002","title":"Finding optimal satisficing strategies for and-or trees","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Probabilistic logic; Tree (set theory); Set (abstract data type); Node (physics); Computer science; Outcome (game theory); Satisficing; Class (philosophy); Mathematical optimization; Task (project management); Mathematics; Test (biology); Algorithm; Artificial intelligence; Combinatorics; Mathematical economics","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.002701011,0.001564577,0.001733441,0.001460857,0.0009453686,0.002267648,0.002275689,0.002089059,0.006416251],"category_scores_gemma":[0.01581309,0.00144753,0.001605334,0.001328795,0.001554689,0.005898037,0.00146748,0.002610324,0.0007713961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690611,"about_ca_system_score_gemma":0.002139762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002531667,"about_ca_topic_score_gemma":0.005944588,"domain_scores_codex":[0.9979606,0.0007931411,0.0001703869,0.0003597488,0.0003127688,0.0004034242],"domain_scores_gemma":[0.9869323,0.0111507,0.0004308129,0.0007053852,0.0005311449,0.0002495409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001549167,0.0007812786,0.004967705,0.00166816,0.0003306123,0.0005797938,0.001591131,0.2766924,0.01560396,0.2076871,0.01729028,0.4712585],"study_design_scores_gemma":[0.0002517951,0.0002524579,0.0004983977,0.0001503664,0.0002314266,0.0001951688,0.0006172233,0.6072464,0.007149129,0.3804691,0.00288757,0.00005106129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2476789,0.001325488,0.7307249,0.001500203,0.0001049113,0.0005498318,0.000820693,0.002344673,0.01495048],"genre_scores_gemma":[0.5595607,0.0005534412,0.4339123,0.000459943,0.00004419271,0.0001917375,0.00103274,0.0005722511,0.00367273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006416251,"threshold_uncertainty_score":0.02146453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1111722750895888,"score_gpt":0.3551924202138077,"score_spread":0.2440201451242189,"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."}}