{"id":"W2126983591","doi":"10.1145/1057661.1057725","title":"Utilizing don't care states in SAT-based bounded sequential problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Boolean satisfiability problem; Model checking; Computer science; Solver; Equivalence (formal languages); Theoretical computer science; Mathematics; Mathematical optimization; Algorithm; Discrete 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.003955094,0.00116392,0.001125172,0.001230545,0.001173378,0.001845667,0.001917854,0.001524285,0.002774532],"category_scores_gemma":[0.01272503,0.0009748241,0.001445551,0.001050397,0.002345308,0.003302027,0.001538051,0.002039443,0.0005518965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009902196,"about_ca_system_score_gemma":0.002499793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003095834,"about_ca_topic_score_gemma":0.00567557,"domain_scores_codex":[0.9965975,0.001654942,0.0002196255,0.0004078906,0.0008443316,0.0002757265],"domain_scores_gemma":[0.9894593,0.007691426,0.0005037771,0.001597658,0.0006262388,0.0001217125],"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.001028105,0.000394233,0.003860713,0.0004911443,0.0001375771,0.0007655431,0.0008076222,0.4164992,0.02830125,0.2508214,0.003248333,0.2936449],"study_design_scores_gemma":[0.0001222838,0.0002375212,0.0002771449,0.00007494698,0.00008965395,0.0001690058,0.0001056052,0.8414881,0.02876057,0.1237415,0.004891571,0.00004211701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04076321,0.000239669,0.9534947,0.0003867347,0.00004909723,0.0001585164,0.00006251589,0.001221018,0.003624463],"genre_scores_gemma":[0.4791893,0.000304299,0.5169249,0.000336329,0.0000385201,0.0004206276,0.0002640371,0.0002449186,0.002277125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003955094,"threshold_uncertainty_score":0.02091682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03977499646281055,"score_gpt":0.3085277922968641,"score_spread":0.2687527958340535,"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."}}