{"id":"W3186637254","doi":"10.1016/j.artint.2021.103557","title":"Strategic reasoning with a bounded number of resources: The quest for tractability","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; Université de Sherbrooke","keywords":"Bounded function; Model checking; Temporal logic; Turing machine; EXPTIME; Computer science; Theoretical computer science; Path (computing); Time complexity; Computational complexity theory; Boolean satisfiability problem; Computation tree logic; Mathematics; Discrete mathematics; Algorithm; PSPACE; Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02394828,0.002280483,0.005710598,0.003202333,0.003795779,0.01219774,0.007244661,0.007907958,0.01222837],"category_scores_gemma":[0.1221277,0.003241,0.006583485,0.003351792,0.01843901,0.0471062,0.01176954,0.01826132,0.002183708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006430762,"about_ca_system_score_gemma":0.005992656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007063424,"about_ca_topic_score_gemma":0.007089007,"domain_scores_codex":[0.9777002,0.01287697,0.001422645,0.002937221,0.003499542,0.001563419],"domain_scores_gemma":[0.7343585,0.2302393,0.005005628,0.02415939,0.003997022,0.002240153],"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.0001683101,0.0001327051,0.0004821892,0.0003240489,0.0001427469,0.0001601448,0.0002659645,0.05489573,0.0003453504,0.9331336,0.002193034,0.007756141],"study_design_scores_gemma":[0.00003142092,0.00001372966,0.00003716194,0.00002972349,0.00001781438,0.00002640996,0.00002768046,0.05467732,0.0001096759,0.944299,0.0007194755,0.00001047682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575249,0.001783143,0.9043028,0.02024518,0.0001463198,0.0002476817,0.0008020163,0.0007879483,0.03593237],"genre_scores_gemma":[0.6197956,0.003330084,0.3566681,0.003687116,0.0009900163,0.001331527,0.001517092,0.0009620408,0.01171844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02394828,"threshold_uncertainty_score":0.1266521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0629153797926646,"score_gpt":0.3134029982278982,"score_spread":0.2504876184352336,"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."}}