{"id":"W152472178","doi":"10.1609/aaai.v26i1.8373","title":"MAXSAT Heuristics for Cost Optimal Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Nanjing University; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Maximum satisfiability problem; Heuristics; Heuristic; Computation; Encoding (memory); Set (abstract data type); Computer science; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Boolean function","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714096,0.00114859,0.0008640552,0.001475087,0.0006359069,0.002102603,0.001489183,0.0008419609,0.00597491],"category_scores_gemma":[0.005033218,0.0007913562,0.001091404,0.002268492,0.001279964,0.001947941,0.001348082,0.002187316,0.0009050803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003122971,"about_ca_system_score_gemma":0.002284695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005023387,"about_ca_topic_score_gemma":0.009838878,"domain_scores_codex":[0.9985191,0.0006839313,0.0000815311,0.00017677,0.0003906799,0.0001480037],"domain_scores_gemma":[0.9977962,0.001597006,0.0001519882,0.0002500705,0.0001512544,0.00005339798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002095572,0.0000745522,0.0003145026,0.0003101892,0.00005419998,0.00008861622,0.0001298915,0.6653908,0.001579335,0.2079633,0.009004406,0.1148807],"study_design_scores_gemma":[0.00006829778,0.00005263614,0.0001280842,0.00009030606,0.00002526326,0.0000360435,0.0000480194,0.7956285,0.00202189,0.1934494,0.008432323,0.00001912407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01057282,0.001097409,0.9732586,0.0005252075,0.00008699315,0.0002043329,0.0005286079,0.001648451,0.01207764],"genre_scores_gemma":[0.1761071,0.0008422498,0.8176608,0.0003021615,0.00009596634,0.0003803939,0.0009502327,0.0003940778,0.003266983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00597491,"threshold_uncertainty_score":0.02265882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1198931776754443,"score_gpt":0.3230394606003565,"score_spread":0.2031462829249122,"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."}}