{"id":"W2807463858","doi":"10.1609/aaai.v32i1.12164","title":"Preliminary Results on Exploration-Driven Satisfiability Solving","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Satisfiability; Boolean satisfiability problem; Computer science; Branching (polymer chemistry); Heuristics; DPLL algorithm; Space (punctuation); Theoretical computer science; Algorithm; Artificial intelligence; Chemistry","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.0004841844,0.0001854025,0.0001737036,0.0001312065,0.0003310455,0.0002392195,0.001068191,0.00008403924,0.00008758015],"category_scores_gemma":[0.0009612726,0.0001460165,0.00008214108,0.0005839043,0.0003887427,0.0007471712,0.0002452815,0.0002188784,0.0001742112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006019845,"about_ca_system_score_gemma":0.0001050375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002151878,"about_ca_topic_score_gemma":0.00002138307,"domain_scores_codex":[0.9981537,0.00002914764,0.000568949,0.0005401988,0.0004603908,0.0002475574],"domain_scores_gemma":[0.9981042,0.0001537903,0.0003917059,0.0003913682,0.0008799069,0.0000790925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002987639,0.0001335113,0.000316263,0.00001567509,0.00000983779,2.383755e-7,0.003550664,0.0005273896,0.006585079,0.8256629,0.0004520019,0.1624477],"study_design_scores_gemma":[0.00007442755,0.001387481,0.002302111,0.0002919771,0.00000991155,0.00000380063,0.0006731391,0.4325846,0.4339123,0.1282822,0.0001573425,0.0003208203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2389486,0.000008517053,0.6005392,0.035308,0.002931279,0.001921639,0.00003019767,0.0006378889,0.1196747],"genre_scores_gemma":[0.9896143,0.00001262459,0.009837016,0.0002633691,0.0001068482,0.00002036829,8.395286e-7,0.000007917269,0.0001367131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7506657,"threshold_uncertainty_score":0.5954381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08495256228418385,"score_gpt":0.2989239085729972,"score_spread":0.2139713462888133,"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."}}