{"id":"W2170245713","doi":"10.1017/s1471068414000015","title":"aspeed: Solver scheduling via answer set programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Answer set programming; Solver; Constraint programming; Benchmarking; Boolean satisfiability problem; Scheduling (production processes); Set (abstract data type); Computation; Satisfiability; Theoretical computer science; Simple (philosophy); Mathematical optimization; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008151505,0.0002734707,0.0003578537,0.0001143185,0.0003394381,0.0003205347,0.0006769043,0.0001615016,0.00002007946],"category_scores_gemma":[0.003404222,0.0002220716,0.0001059651,0.0004047373,0.0002619597,0.001436225,0.0003982401,0.0003685685,0.00003452096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001994535,"about_ca_system_score_gemma":0.00004766856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001905,"about_ca_topic_score_gemma":0.000002890192,"domain_scores_codex":[0.9970636,0.001096943,0.0003944598,0.000567354,0.0003034775,0.0005741104],"domain_scores_gemma":[0.9955725,0.003014453,0.0004458024,0.0005592352,0.0002275857,0.0001804364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008839485,0.0001277627,0.0001371426,0.00006035323,0.00004292551,0.00001234492,0.002092957,0.00001291047,0.0003813942,0.4836566,0.000008230681,0.513379],"study_design_scores_gemma":[0.002465048,0.00282045,0.0003289783,0.0003301564,0.0004249663,0.001341508,0.004875867,0.0160308,0.004268372,0.5304081,0.4348697,0.001836004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006169232,0.001762034,0.9675699,0.0005652728,0.0003877122,0.0003754806,4.36612e-7,0.00032933,0.02284057],"genre_scores_gemma":[0.6992174,0.00003952402,0.3001001,0.0003206552,0.0001570302,0.00002160577,0.000002823508,0.00001389715,0.0001270222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6930481,"threshold_uncertainty_score":0.9055817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02471089799935112,"score_gpt":0.2937271739713797,"score_spread":0.2690162759720285,"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."}}