{"id":"W4242222923","doi":"10.1109/iccad.1990.129967","title":"A method for concurrent decomposition and factorization of Boolean expressions","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Literal (mathematical logic); Decomposition; Factorization; Simplicity; Algebraic expression; Cube (algebra); Benchmark (surveying); Computer science; Duality (order theory); Theoretical computer science; Algebraic number; Algorithm; Algebra over a field; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002040539,0.00004920145,0.0000749108,0.00005143615,0.00005256286,0.00002403938,0.0001429551,0.00003000402,0.00001643175],"category_scores_gemma":[0.00005244088,0.00004234158,0.00002161565,0.00009828657,0.00001436664,0.0003113975,0.00004410814,0.00002522132,0.000001352615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000105087,"about_ca_system_score_gemma":0.00000337492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003018434,"about_ca_topic_score_gemma":3.553808e-7,"domain_scores_codex":[0.9994838,0.00006534026,0.0001518631,0.0001447381,0.00008070561,0.00007360959],"domain_scores_gemma":[0.9995339,0.0001247773,0.00008160173,0.0001591385,0.00006596138,0.0000346132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002060752,0.00005570997,0.00007796387,0.00003047863,0.00000522423,4.28231e-8,0.0008179654,0.00003816191,0.05565257,0.5654165,0.0003928022,0.3775106],"study_design_scores_gemma":[0.0002458405,0.0001078313,0.0008279425,0.00001787942,0.000005155267,0.000002930901,0.00002093743,0.8367577,0.1547009,0.004734118,0.002498632,0.00008014104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007105927,0.00005359464,0.9980324,0.0001095124,0.0001619543,0.0001863468,0.000003074546,0.00004879696,0.0006937607],"genre_scores_gemma":[0.2188354,0.00001240333,0.7810326,0.00002805151,0.00001089535,0.00001787595,0.000001874602,0.000002268752,0.00005860854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8367195,"threshold_uncertainty_score":0.172664,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05892151951455472,"score_gpt":0.3737392400747193,"score_spread":0.3148177205601646,"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."}}