{"id":"W2807385899","doi":"10.1007/978-3-319-93031-2_34","title":"A $$O(n \\log ^2 n)$$ Checker and $$O(n^2 \\log n)$$ Filtering Algorithm for the Energetic Reasoning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Satisfiability; Computer science; Binary logarithm; Interval (graph theory); Algorithm; Time complexity; Process (computing); State (computer science); Running time; Constraint (computer-aided design); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; 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.002410999,0.003478013,0.002242692,0.002851893,0.003203715,0.005207838,0.007302415,0.003210195,0.103261],"category_scores_gemma":[0.009651046,0.001681859,0.005948962,0.0029358,0.002109026,0.009850261,0.005792805,0.006717998,0.03024114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003454827,"about_ca_system_score_gemma":0.004196035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007836705,"about_ca_topic_score_gemma":0.01524612,"domain_scores_codex":[0.9969295,0.0005151643,0.000186187,0.0009086194,0.001130166,0.0003303667],"domain_scores_gemma":[0.9951215,0.00212801,0.0001205262,0.001840182,0.0006527812,0.0001369416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006495136,0.0004099916,0.0005717061,0.0005879627,0.0001777237,0.000146805,0.000124645,0.01663019,0.009209064,0.217181,0.1047799,0.6495314],"study_design_scores_gemma":[0.0003564529,0.00008125583,0.0006650816,0.0002050176,0.0002125008,0.0002902743,0.0001493099,0.3965161,0.01160553,0.5197875,0.07002865,0.0001022459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003047994,0.0002834672,0.9454771,0.001297791,0.0005399183,0.0003293964,0.0009999516,0.01246348,0.03556087],"genre_scores_gemma":[0.03590629,0.0002304938,0.9304308,0.0007934988,0.0002593623,0.0003623116,0.002228005,0.002100759,0.02768846],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.103261,"threshold_uncertainty_score":0.3454425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0145130423926603,"score_gpt":0.2391570942852763,"score_spread":0.224644051892616,"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."}}