{"id":"W119782953","doi":"10.5591/978-1-57735-516-8/ijcai11-099","title":"A uniform approach for generating proofs and strategies for both true and false QBF formulas","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Mathematical proof; Computer science; Conjunctive normal form; Falsity; True quantified Boolean formula; Simple (philosophy); Solver; Algorithm; Representation (politics); Computation; Theoretical computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351393,0.0002132471,0.0002012739,0.0001767797,0.0002004768,0.000513707,0.0005743617,0.0000942914,0.00001270375],"category_scores_gemma":[0.0002827257,0.0001956953,0.00006133151,0.0001043073,0.0001579993,0.0009459741,0.0001392559,0.000130361,0.000004006277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004679905,"about_ca_system_score_gemma":0.0001229337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004454437,"about_ca_topic_score_gemma":0.00002909728,"domain_scores_codex":[0.9983508,0.00004144392,0.0005202749,0.000569533,0.0002370747,0.000280886],"domain_scores_gemma":[0.9988729,0.0001157938,0.0002316537,0.0002840828,0.000399059,0.00009647889],"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.00006523313,0.00006897729,0.00000916365,0.00002760572,0.00001567316,4.599198e-7,0.001508757,0.0001563323,0.002933252,0.7947174,0.000006842671,0.2004903],"study_design_scores_gemma":[0.000058103,0.000296637,0.00006370813,0.00002907736,0.000005311598,0.00001096795,0.0007099372,0.6981547,0.03428996,0.2660585,0.0001364799,0.0001866401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008031922,0.00002151,0.98623,0.0002270286,0.0004064922,0.0008226845,0.0000246435,0.00008743598,0.004148242],"genre_scores_gemma":[0.4757617,0.00001626911,0.523738,0.0001066933,0.00007157677,0.0002412528,0.000007869084,0.000008625979,0.00004807651],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6979983,"threshold_uncertainty_score":0.7980222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.266406923665083,"score_gpt":0.3559615866280027,"score_spread":0.0895546629629197,"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."}}