{"id":"W182621935","doi":"","title":"Flexible execution of partial order plans with temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Schedule; Executor; Generalization; Variety (cybernetics); State (computer science); Order (exchange); Distributed computing; Operations research; Artificial intelligence; Programming language; Operating system; Engineering","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002752514,0.0002022952,0.0002109226,0.000203372,0.0000959001,0.0002666625,0.0007606377,0.00008218486,0.001097936],"category_scores_gemma":[0.0001081234,0.0001703526,0.00005552685,0.0002767022,0.0002738651,0.0005109588,0.00009725077,0.0002417624,0.0005248281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004440732,"about_ca_system_score_gemma":0.000243748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004708932,"about_ca_topic_score_gemma":0.00003445747,"domain_scores_codex":[0.9980996,0.00006759869,0.0005482032,0.0004383689,0.000554663,0.0002916001],"domain_scores_gemma":[0.9984369,0.0001234268,0.000276761,0.0003365361,0.0007105995,0.0001157459],"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.00006589026,0.0001926039,0.001159595,0.00001161673,0.00005012444,0.00001837812,0.0007915349,0.004127157,0.005410474,0.8365106,0.000372357,0.1512897],"study_design_scores_gemma":[0.0001751905,0.0009289703,0.00148207,0.0006299018,0.0000124665,0.00007741628,0.0007275477,0.5555013,0.3330284,0.1059642,0.0007680613,0.0007044359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02431121,0.00000579394,0.9593503,0.003415458,0.0005431604,0.0002443727,0.00002196109,0.0001397309,0.01196804],"genre_scores_gemma":[0.9756579,0.000004758994,0.0237269,0.0002497293,0.00007825124,0.00003744218,0.00002369211,0.000008707246,0.0002126116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9513467,"threshold_uncertainty_score":0.9998152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08728091937032868,"score_gpt":0.2954974309334702,"score_spread":0.2082165115631415,"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."}}