{"id":"W2398036300","doi":"10.29007/fblb","title":"CDCL with Less Destructive Backtracking through Partial Ordering","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Backtracking; Satisfiability; Boolean satisfiability problem; Solver; Relation (database); Computer science; Series (stratigraphy); Algorithm; Theoretical computer science; Combinatorics; Mathematics; Programming language; Data mining","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.001395987,0.0008042499,0.0007739415,0.001216462,0.0006848495,0.001494558,0.001710794,0.001210705,0.009414186],"category_scores_gemma":[0.00590654,0.0005292716,0.0008498572,0.002086372,0.00144114,0.00227777,0.002294913,0.002222209,0.001210479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297105,"about_ca_system_score_gemma":0.003718904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005603324,"about_ca_topic_score_gemma":0.01880949,"domain_scores_codex":[0.9984276,0.0004764623,0.0001024319,0.0002623246,0.0004905234,0.0002406695],"domain_scores_gemma":[0.995654,0.002415512,0.0001831223,0.0009165218,0.0006651196,0.0001656764],"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.0005544418,0.0005874708,0.002341781,0.0005944549,0.0000849409,0.0003330741,0.000292447,0.3679211,0.01523729,0.1238792,0.01974449,0.4684294],"study_design_scores_gemma":[0.0003396354,0.0001517271,0.0002528637,0.00005525957,0.00005206238,0.0001269303,0.0000921371,0.8548134,0.01400672,0.1147042,0.01536457,0.00004051962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05361477,0.0005640286,0.9192846,0.0009594898,0.0001795899,0.0002761057,0.0006429303,0.006639011,0.01783943],"genre_scores_gemma":[0.2774155,0.0002114133,0.7118306,0.0005809306,0.00004895877,0.0002001395,0.0009510187,0.0006221733,0.008139255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009414186,"threshold_uncertainty_score":0.0314936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02310364717064647,"score_gpt":0.2643554549334236,"score_spread":0.2412518077627771,"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."}}