{"id":"W155860189","doi":"10.1609/icaps.v22i1.13537","title":"Optimally Relaxing Partial-Order Plans with MaxSAT","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"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; Order (exchange); Minification; Operations research; Artificial intelligence; Mathematics","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.0005740006,0.0001884053,0.000172633,0.000125006,0.0002322845,0.0002958695,0.0008087458,0.00008375174,0.000009593882],"category_scores_gemma":[0.000136273,0.0001308327,0.00003374757,0.0002240465,0.00006053539,0.0006227318,0.0002013906,0.000325592,0.000005701035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002773129,"about_ca_system_score_gemma":0.00006645659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464122,"about_ca_topic_score_gemma":2.980223e-7,"domain_scores_codex":[0.9986793,0.00001203124,0.0002594999,0.0002761307,0.0004460709,0.0003268982],"domain_scores_gemma":[0.9991172,0.0001045135,0.000287169,0.0001069131,0.0002825536,0.0001016318],"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.0003183284,0.0001951788,0.4195167,0.0001915105,0.0003745145,0.00001029442,0.01273852,0.02801088,0.03566195,0.4993568,0.001025953,0.00259934],"study_design_scores_gemma":[0.0004390985,0.0001254815,0.009351161,0.001509419,0.00002102254,0.0001110311,0.000580235,0.974865,0.0118419,0.0005710142,0.0002712342,0.0003134683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.967544,0.0001312508,0.0116612,0.002609369,0.0004263421,0.0001355326,0.000007226659,0.0005888224,0.01689632],"genre_scores_gemma":[0.9403245,0.000006290812,0.05928051,0.0001861629,0.0000645637,0.00000875469,0.00000299608,0.00001176681,0.0001144227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9468541,"threshold_uncertainty_score":0.5335204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03352342834652276,"score_gpt":0.2690857539899184,"score_spread":0.2355623256433956,"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."}}