{"id":"W2789610989","doi":"10.1609/icaps.v28i1.13920","title":"Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Exploration Systems; National Aeronautics and Space Administration","keywords":"Computer science; Satisficing; Task (project management); Time horizon; Constraint (computer-aided design); Class (philosophy); Constraint programming; Quantum; Baseline (sea); Mathematical optimization; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Routing (electronic design automation)","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.004014354,0.001117979,0.0007923367,0.001071009,0.0006854163,0.001997201,0.00182368,0.001118967,0.003167836],"category_scores_gemma":[0.01911166,0.0005931284,0.0009632413,0.002148057,0.001456693,0.003230302,0.001886579,0.003127842,0.0003063698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864135,"about_ca_system_score_gemma":0.004181787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01527286,"about_ca_topic_score_gemma":0.02539518,"domain_scores_codex":[0.9971252,0.001364332,0.0001365187,0.0004344746,0.0006724932,0.0002669096],"domain_scores_gemma":[0.9852705,0.01181566,0.0004363784,0.0013273,0.0008173722,0.0003328006],"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.0002896544,0.0001855108,0.001540175,0.0003851709,0.0001112129,0.00007195822,0.0002096322,0.8084512,0.002092614,0.03643868,0.002184964,0.1480392],"study_design_scores_gemma":[0.00003326846,0.00009891077,0.0002778124,0.000031423,0.00003614138,0.00002485266,0.00007892332,0.9715368,0.001647159,0.02335078,0.002866906,0.00001699855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09343936,0.002526367,0.883769,0.00164098,0.0002073276,0.0002456944,0.0002743074,0.002016681,0.01588022],"genre_scores_gemma":[0.4656086,0.0009391895,0.5297212,0.0004177023,0.00007802027,0.0002392476,0.0003688407,0.0005928011,0.00203432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01527286,"threshold_uncertainty_score":0.03036791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08699356612568282,"score_gpt":0.3177409570303168,"score_spread":0.230747390904634,"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."}}