{"id":"W1591802374","doi":"10.1007/978-3-540-24605-3_26","title":"Effective Preprocessing with Hyper-Resolution and Equality Reduction","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; DPLL algorithm; Reduction (mathematics); Search tree; Preprocessor; Pruning; Solver; Boolean satisfiability problem; Tree (set theory); Algorithm; Node (physics); Benchmark (surveying); Theoretical computer science; Mathematical optimization; Search algorithm; Artificial intelligence; 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.001557933,0.001429883,0.001685944,0.001990294,0.002035425,0.004173668,0.004031321,0.001520503,0.02573397],"category_scores_gemma":[0.006842238,0.001429607,0.002437391,0.003819389,0.001802773,0.008513758,0.005658505,0.005623288,0.01028123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069554,"about_ca_system_score_gemma":0.001934674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001373801,"about_ca_topic_score_gemma":0.003029815,"domain_scores_codex":[0.9961002,0.001003108,0.0002774345,0.0008097251,0.001291335,0.0005182651],"domain_scores_gemma":[0.9955339,0.00155808,0.0001116375,0.002060574,0.0006512661,0.00008436384],"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.0004237469,0.0002801125,0.0004618181,0.001013729,0.0001570841,0.0003932615,0.0004602037,0.01632191,0.02108446,0.3425202,0.04672917,0.5701544],"study_design_scores_gemma":[0.00008352406,0.00004974828,0.0004123886,0.0001476773,0.0001454237,0.0004162323,0.0002803582,0.07376561,0.05392029,0.7980861,0.07261179,0.00008077554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006332159,0.001038028,0.9628072,0.0009223219,0.0003611541,0.0001324446,0.0006123307,0.003907974,0.02388639],"genre_scores_gemma":[0.1107477,0.0009536268,0.8544887,0.0007113818,0.0003443889,0.0002345029,0.002671591,0.002592701,0.02725543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02573397,"threshold_uncertainty_score":0.08608872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01220269376855133,"score_gpt":0.2419361708464378,"score_spread":0.2297334770778865,"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."}}