{"id":"W2528006267","doi":"","title":"Mixed-Integer Linear Programming for Planning with Temporal Logic Tasks [Position Paper]","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nutrasource","funders":"","keywords":"Integer programming; Computer science; Linear programming; Computation; Mathematical optimization; Linear temporal logic; Dynamical systems theory; Task (project management); Integer (computer science); Theoretical computer science; Algorithm; Mathematics; Engineering; Programming language; Systems 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002615827,0.001463503,0.0007577647,0.0006191006,0.00062863,0.002305926,0.001311824,0.001231447,0.008590264],"category_scores_gemma":[0.006097903,0.0008544547,0.00126333,0.001713184,0.001606891,0.002042466,0.00144888,0.003152221,0.001382797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002065843,"about_ca_system_score_gemma":0.002589862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005103572,"about_ca_topic_score_gemma":0.005689512,"domain_scores_codex":[0.9983221,0.0008387066,0.00008491884,0.0002332565,0.000407331,0.0001136543],"domain_scores_gemma":[0.9975082,0.001944942,0.0001789246,0.0001100798,0.0001629164,0.00009487465],"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.0001562439,0.00009829042,0.0002544845,0.0004653255,0.00009397938,0.0001724595,0.0001919828,0.3800641,0.001447462,0.5182468,0.01145497,0.08735392],"study_design_scores_gemma":[0.00004743143,0.00005082742,0.00005641513,0.00007709342,0.00002454874,0.00004202929,0.00002311129,0.732271,0.0007567715,0.2516451,0.01498465,0.00002113103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001315194,0.00100975,0.9897444,0.0007111948,0.0001386364,0.00006253643,0.00009853761,0.0002018098,0.006718079],"genre_scores_gemma":[0.1106828,0.002283314,0.8745837,0.0006431409,0.0003884379,0.0006670654,0.0005323624,0.0003188421,0.009900265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008590264,"threshold_uncertainty_score":0.02873725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3511121685748741,"score_gpt":0.4138192855756894,"score_spread":0.06270711700081527,"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."}}