{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592251,0.001046806,0.0006540097,0.001194503,0.0006784713,0.002228444,0.001983339,0.001001743,0.012864],"category_scores_gemma":[0.01010334,0.000526365,0.001255302,0.001388906,0.001072675,0.002328342,0.001972693,0.002534065,0.00228916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001129045,"about_ca_system_score_gemma":0.002216562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205737,"about_ca_topic_score_gemma":0.00253022,"domain_scores_codex":[0.997044,0.001192654,0.0002169723,0.0004046914,0.0008701091,0.000271613],"domain_scores_gemma":[0.9949891,0.00310345,0.0002471149,0.0008190283,0.0006788992,0.0001624517],"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.0004736657,0.000461188,0.001324256,0.0005969802,0.0000836303,0.000259068,0.0002590543,0.3798607,0.008159076,0.2268149,0.03159198,0.3501154],"study_design_scores_gemma":[0.00009046087,0.00009176632,0.0001164887,0.00005010582,0.00002576571,0.00005285823,0.00004942554,0.8433764,0.009534929,0.133994,0.01259867,0.00001921147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01367623,0.0001621542,0.9672355,0.0007084105,0.0002030662,0.0002378556,0.0008287475,0.006508051,0.01043995],"genre_scores_gemma":[0.1833254,0.000199021,0.8086811,0.0003994636,0.0001117229,0.0004011177,0.002016847,0.001228451,0.003637031],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.012864,"threshold_uncertainty_score":0.04303437,"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."}}