{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000710641,0.0001468149,0.0002087719,0.00001967139,0.000262381,0.0002521809,0.0007101696,0.00006534479,0.00005852301],"category_scores_gemma":[0.0003197568,0.00009595983,0.0001038316,0.0005299093,0.0002548581,0.0002198312,0.000108797,0.0001553085,0.00003535325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003197601,"about_ca_system_score_gemma":0.0002724711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001397662,"about_ca_topic_score_gemma":0.0009678811,"domain_scores_codex":[0.9984845,0.0001369152,0.000359849,0.0004676489,0.0002333884,0.0003177064],"domain_scores_gemma":[0.9980546,0.0005708655,0.0001584639,0.000697705,0.0004453185,0.0000730699],"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.00004091387,0.000176877,0.0009217216,0.00002709653,0.00002079302,0.000009894709,0.004231948,0.0000827414,0.0006347424,0.9788215,0.00001887431,0.0150129],"study_design_scores_gemma":[0.00009138335,0.0003077302,0.001210479,0.0001413299,0.00004372843,0.0001257821,0.005156644,0.05483687,0.1665558,0.7673519,0.003706015,0.0004722954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4305465,0.0002270209,0.5480469,0.0006545143,0.0002814169,0.0003051201,0.000004709568,0.00009841746,0.01983538],"genre_scores_gemma":[0.981532,0.000009929948,0.01804233,0.00008002917,0.0001015357,0.00003462489,0.000002012586,0.00000897454,0.0001885022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5509855,"threshold_uncertainty_score":0.3913129,"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."}}