{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","routes":{"ca_aff":true,"ca_fund":true,"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.005630549,0.0001241987,0.0002034849,0.0004866753,0.0003096478,0.0002665052,0.001149724,0.00011414,0.0001635284],"category_scores_gemma":[0.001062982,0.00008137616,0.00009546232,0.0008561151,0.0001657457,0.0008745661,0.0001822102,0.000584093,0.0004208913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001142522,"about_ca_system_score_gemma":0.0003721636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003376392,"about_ca_topic_score_gemma":0.000007403647,"domain_scores_codex":[0.9967722,0.0004572205,0.0007355089,0.0002681845,0.001172673,0.0005942505],"domain_scores_gemma":[0.9967875,0.001143523,0.0003082879,0.0003726224,0.001137619,0.0002504408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002427461,0.0001657391,0.0008837868,0.00001752894,0.00004521053,0.0002277571,0.001908496,0.005662408,0.03800736,0.03771637,0.002662319,0.9124603],"study_design_scores_gemma":[0.0002576144,0.003497135,0.0004642821,0.001020088,0.00002064813,0.0006033775,0.0008099165,0.2507563,0.5826594,0.1354214,0.02373241,0.0007574083],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04182516,0.0001780807,0.9511614,0.0058561,0.0004874595,0.00009522946,0.000001300269,0.00002968563,0.0003655208],"genre_scores_gemma":[0.9473227,0.0001011882,0.05163166,0.00004685421,0.0005406199,0.000003894603,4.603855e-7,0.00001303093,0.000339567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9117029,"threshold_uncertainty_score":0.5409846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.154734988145756,"score_gpt":0.3874821599405522,"score_spread":0.2327471717947962,"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."}}