{"id":"W4200406741","doi":"10.1109/iccad51958.2021.9643520","title":"An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae","year":2021,"lang":"en","type":"article","venue":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Implicant; Prime (order theory); Computer science; Benchmark (surveying); Interleaving; Bottleneck; Algorithm; Theoretical computer science; Boolean function; Mathematics; Combinatorics; Boolean expression","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001115854,0.0003892872,0.0005234512,0.000413906,0.0001907478,0.0004805225,0.002175438,0.0001507164,0.00008737866],"category_scores_gemma":[0.0001371134,0.0004060618,0.0002229794,0.0004540796,0.00005891931,0.0004845335,0.0003503716,0.00027693,0.0000266439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379125,"about_ca_system_score_gemma":0.0004883177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001815428,"about_ca_topic_score_gemma":0.000002748196,"domain_scores_codex":[0.9964632,0.0004509752,0.0008755409,0.001037589,0.0007566456,0.0004159838],"domain_scores_gemma":[0.9954365,0.000693845,0.0005077214,0.001213758,0.001950364,0.0001978422],"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.0003069213,0.001942239,0.00003819219,0.00004188369,0.0002196328,0.00004323972,0.000973145,0.6357303,0.04969337,0.1710594,0.003354355,0.1365974],"study_design_scores_gemma":[0.001993201,0.0008754637,0.00008274097,0.000140155,0.00001676551,0.00002507016,0.00001191144,0.8545383,0.1338707,0.00786649,0.0002146699,0.000364496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001684791,0.00001679114,0.9943197,0.0007238822,0.001363731,0.0006166085,0.00005104747,0.0002531956,0.0009702519],"genre_scores_gemma":[0.3054819,0.0000098949,0.6934913,0.0004071879,0.0002787046,0.00004522773,0.0001321642,0.00002277275,0.0001309353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3037971,"threshold_uncertainty_score":0.9998391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0781986651510313,"score_gpt":0.3923706249752426,"score_spread":0.3141719598242113,"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."}}