{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336645,0.0002169861,0.0002642138,0.00007895617,0.0003398604,0.0003872103,0.001463401,0.0001034995,0.00003118324],"category_scores_gemma":[0.0008208998,0.0001802979,0.0001346968,0.0004946078,0.0001330744,0.0002695751,0.0003462493,0.0003051758,0.00003060855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003798319,"about_ca_system_score_gemma":0.0002167939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008036731,"about_ca_topic_score_gemma":0.000001430014,"domain_scores_codex":[0.9981794,0.0000170931,0.0004794688,0.0005222776,0.0003734519,0.0004282926],"domain_scores_gemma":[0.9980248,0.0003138779,0.0003151022,0.0003027818,0.000940849,0.0001026171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007217608,0.0001103372,0.0005011687,0.0001034701,0.00002520577,0.000004176479,0.001905994,0.002540504,0.01742646,0.9283049,0.001603327,0.04740226],"study_design_scores_gemma":[0.00005142979,0.0001955052,0.00007884678,0.0005274818,0.00002042606,0.00001918838,0.0006350579,0.3127336,0.5964551,0.08704894,0.00190782,0.0003266252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03880012,0.0001472617,0.9423164,0.006510256,0.001094554,0.0006481779,0.00003119241,0.0001987497,0.01025326],"genre_scores_gemma":[0.9443582,0.00001309276,0.05453353,0.00037006,0.0001069508,0.00004086461,0.000002705606,0.00001540898,0.0005592256],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.905558,"threshold_uncertainty_score":0.7352335,"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."}}