{"id":"W2186752618","doi":"10.1007/978-3-642-30353-1_36","title":"Dsharp: Fast d-DNNF Compilation with sharpSAT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Topic Modeling","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Exploit; Programming language; Negation; Representation (politics); Theoretical computer science; De facto; Algorithm","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.0005354053,0.001848464,0.0008159629,0.001235967,0.0009026178,0.001892101,0.002298542,0.0009139312,0.0415824],"category_scores_gemma":[0.002928819,0.001076735,0.001621164,0.001703809,0.000842259,0.004074706,0.002892524,0.002165403,0.01451271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001425041,"about_ca_system_score_gemma":0.00171562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004254347,"about_ca_topic_score_gemma":0.01074561,"domain_scores_codex":[0.9991684,0.0001299106,0.00009021999,0.000282557,0.0002059358,0.000123004],"domain_scores_gemma":[0.9983462,0.0006990333,0.00005010108,0.000605468,0.0002500534,0.00004910464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008370011,0.0002294435,0.00123672,0.001804559,0.0001368881,0.0002736137,0.000339689,0.02751561,0.0209009,0.07307726,0.1827095,0.6909388],"study_design_scores_gemma":[0.0007019727,0.000219467,0.0007930351,0.0004286915,0.0002576038,0.0004212834,0.0003806518,0.285162,0.08309728,0.3680022,0.2603531,0.0001826996],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0180736,0.001165117,0.7483744,0.000811143,0.0009939322,0.0003094406,0.009943276,0.1683753,0.05195381],"genre_scores_gemma":[0.2194093,0.0006604664,0.7114186,0.001048079,0.000247584,0.0005792118,0.01825269,0.02461506,0.02376907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0415824,"threshold_uncertainty_score":0.139107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02359578920508502,"score_gpt":0.2359083907429924,"score_spread":0.2123126015379074,"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."}}